Martin Lackner

Team

Dipl.-Ing. Dr. Martin Lackner

Researcher Data Intelligence (MA)
Department of Computer Science and Security

Location: B - Campus-Platz 1

E: martin.lackner@ustp.at

Study programmes

Data Intelligence (MA)

Departments

Computer Science and Security

Publications

Download Bibtex for all results

Bredereck, R., Faliszewski, P., Furdyna, M., Kaczmarczyk, A., Kaczmarek, J., Lackner, M., Laußmann, C., Rothe, J., & Seeger, T. (2026). How to tamper with a Parliament: Strategic campaigns in apportionment elections. Journal of Computer and System Sciences, 155, 103700. https://doi.org/10.1016/j.jcss.2025.103700

Lackner, M., & Maly, J. (2025). Approval-Based Shortlisting. Social Choice and Welfare, 64, 97–142. http://dx.doi.org/10.1007/s00355-023-01482-2

Lackner, M., & Nardi, O. (2025). Avoiding Overrepresentation: Upper Quota Axioms for Committee Voting. 16th Multidisciplinary Workshop on Advances in Preference Handling (M-PREF 2025). https://events.mpref.org/MPref2025/download/0007.pdf

Brill, M., Freeman, R., Janson, S., & Lackner, M. (2024). Phragmén"s Voting Methods and Justified Representation. Mathematical Programming, 203, 47–76. https://doi.org/10.1007/s10107-023-01926-8

Igarashi, A., Lackner, M., Nardi, O., & Novaro, A. (2024). Repeated Fair Allocation of Indivisible Items. Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI 2024), 9781–9789. https://doi.org/10.1609/aaai.v38i9.28837

Faliszewski, P., Lackner, M., Sornat, K., & Szufa, S. (2023). An Experimental Comparison of Multiwinner Voting Rules on Approval Elections. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI 2023), 2675–2683. https://doi.org/10.24963/ijcai.2023/298

Maly, J., Rey, S., Endriss, U., & Lackner, M. (2023). Fairness in Participatory Budgeting via Equality of Resources. Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2023), 2031–2039. https://dl.acm.org/doi/10.5555/3545946.3598876

Lackner, M., Regner, P., & Krenn, B. (2023). abcvoting: A Python package for approval-based multi-winner voting rules. Journal of Open Source Software, 8(81), 4880. https://doi.org/10.21105/joss.04880

Brill, M., Forster, S., Lackner, M., Maly, J., & Peters, J. (2023). Proportionality in Approval-Based Participatory Budgeting. Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI 2023), 5524–5531. https://doi.org/10.1609/aaai.v37i5.25686

Lackner, M., Maly, J., & Nardi, O. (2023). Free-Riding in Multi-Issue Decisions. Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2023), 2040–2048. https://dl.acm.org/doi/10.5555/3545946.3598877

Lackner, M., & Maly, J. (2023). Proportional Decisions in Perpetual Voting. Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI 2023), 5722–5729. https://doi.org/10.1609/aaai.v37i5.25710

Lackner, M., & Skowron, P. (2023). Multi-Winner Voting with Approval Preferences. Springer International Publishing. https://doi.org/10.1007/978-3-031-09016-5

Szufa, S., Faliszewski, P., Janeczko, L., Lackner, M., Slinko, A., Sornat, K., & Talmon, N. (2022). How to Sample Approval Elections? Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI 2022), 496–502. https://doi.org/10.24963/ijcai.2022/71

Chen, J., Lackner, M., & Maly, J. (2022). Participatory Budgeting with Donations and Diversity Constraints. Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), 9323–9330. https://doi.org/10.1609/aaai.v36i9.21163

Brill, M., Delemazure, T., George, A.-M., Lackner, M., & Schmidt-Kraepelin, U. (2022). Liquid Democracy with Ranked Delegations. Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), 4884–4891. https://doi.org/10.1609/aaai.v36i5.20417

Hamm, T., Lackner, M., & Rapberger, A. (2021). Computing Kemeny Rankings From d-Euclidean Preferences. Proceedings of the 7th International Conference on Algorithmic Decision Theory (ADT 2021), 13023, 147–161. https://doi.org/10.1007/978-3-030-87756-9_10

Lackner, M., Maly, J., & Rey, S. (2021). Fairness in Long-Term Participatory Budgeting. Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021), 299–305. https://doi.org/10.24963/ijcai.2021/42

Lackner, M., Maly, J., & Rey, S. (2021). Fairness in Long-Term Participatory Budgeting (Extended Abstract). Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2021), 1566–1568.

Bibtex

Lackner, M., & Skowron, P. (2021). Consistent Approval-Based Multi-Winner Rules. Journal of Economic Theory, 192, 105173. https://doi.org/10.1016/j.jet.2020.105173

Lackner, M., & Maly, J. (2021). Approval-Based Shortlisting. Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2021), 1566–1568.

Bibtex

Lackner, M., & Skowron, P. (2020). Utilitarian Welfare and Representation Guarantees of Approval-Based Multiwinner Rules. Artificial Intelligence, 288, 103366. https://doi.org/10.1016/j.artint.2020.103366

Lackner, M. (2020). Perpetual Voting: Fairness in Long-Term Decision Making. Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), 2103–2110. https://doi.org/10.1609/aaai.v34i02.5584

Peters, D., & Lackner, M. (2020). Preferences Single-Peaked on a Circle. Journal of Artificial Intelligence Research (JAIR), 68, 463–502. https://doi.org/10.1613/jair.1.11732

Bredereck, R., Faliszewski, P., Furdyna, M., Kaczmarczyk, A., & Lackner, M. (2020). Strategic Campaign Management in Apportionment Elections. Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), 103–109. https://doi.org/10.24963/ijcai.2020/15

Harrenstein, P., Lackner, M.-L., & Lackner, M. (2020). A Mathematical Analysis of an Election System Proposed by Gottlob Frege. Erkenntnis, 87(6), 2609–2644. https://doi.org/10.1007/s10670-020-00318-0

Fitzsimmons, Z., & Lackner, M. (2020). Incomplete Preferences in Single-Peaked Electorates. Journal of Artificial Intelligence Research (JAIR), 67, 797–833. https://doi.org/10.1613/jair.1.11577

Haret, A., Lackner, M., Pfandler, A., & Wallner, J. P. (2020). Proportional Belief Merging. Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), 2822–2829. https://doi.org/10.1609/aaai.v34i03.5671

Gangl, C., Maly, J., Lackner, M., & Woltran, S. (2019). Aggregating Expert Opinions in Support of Medical Diagnostic Decision-Making. 11th International Workshop on Knowledge Representation for Health Care (KR4HC-2019). https://doi.org/http://hdl.handle.net/20.500.12708/57907

Bloembergen, D., Grossi, D., & Lackner, M. (2019). On Rational Delegations in Liquid Democracy. Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI 2019), 1796–1803. https://doi.org/10.1609/aaai.v33i01.33011796

Lackner, M., & Skowron, P. (2019). A Quantitative Analysis of Multi-Winner Rules. Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019), 407–413. https://doi.org/10.24963/ijcai.2019/58

Aziz, H., Elkind, E., Huang, S., Lackner, M., Sánchez-Fernández, L., & Skowron, P. (2018). On the Complexity of Extended and Proportional Justified Representation. Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), 902–909. https://doi.org/10.1609/aaai.v32i1.11478

Csar, T., Lackner, M., & Pichler, R. (2018). Computing the Schulze Method for Large-Scale Preference Data Sets. Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI 2018), 180–187. https://doi.org/10.24963/ijcai.2018/25

Faliszewski, P., Lackner, M., Peters, D., & Talmon, N. (2018). Effective Heuristics for Committee Scoring Rules. Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), 1023–1030. https://doi.org/10.1609/aaai.v32i1.11459

Bredereck, R., Faliszewski, P., Igarashi, A., Lackner, M., & Skowron, P. (2018). Multiwinner Elections with Diversity Constraints. Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), 933–940.

Bibtex

Lackner, M., & Skowron, P. (2018). Approval-Based Multi-Winner Rules and Strategic Voting. Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI 2018), 340–436. https://doi.org/10.24963/ijcai.2018/47

Lackner, M., & Skowron, P. (2018). Consistent Approval-Based Multi-Winner Rules. Proceedings of the 19th ACM Conference on Economics and Computation (EC 2018), 47–48. https://doi.org/10.1145/3219166.3219170

Aziz, H., Elkind, E., Faliszewski, P., Lackner, M., & Skowron, P. (2017). The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality. Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), 84–90. https://doi.org/10.24963/ijcai.2017/13

Brill, M., Freeman, R., Janson, S., & Lackner, M. (2017). Phragmén"s Voting Methods and Justified Representation. Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), 406–413. https://doi.org/10.1609/aaai.v31i1.10598

Csar, T., Lackner, M., Pichler, R., & Sallinger, E. (2017). Winner Determination in Huge Elections with MapReduce. Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), 451–458. https://doi.org/10.1609/aaai.v31i1.10606

Elkind, E., Lackner, M., & Peters, D. (2017). Structured Preferences. In U. Endriss (Ed.), Trends in Computational Social Choice (pp. 187–207). AI Access.

Bibtex

Erdélyi, G., Lackner, M., & Pfandler, A. (2017). Computational Aspects of Nearly Single-Peaked Electorates. Journal of Artificial Intelligence Research (JAIR), 58, 297–337. https://doi.org/10.1613/jair.5210

Lackner, M.-L., & Lackner, M. (2017). On the Likelihood of Single-Peaked Preferences. Social Choice and Welfare, 48(4), 717–745. https://doi.org/10.1007/s00355-017-1033-0

Skowron, P., Lackner, M., Brill, M., Peters, D., & Elkind, E. (2017). Proportional Rankings. Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), 409–415. https://doi.org/10.24963/ijcai.2017/58

Peters, D., & Lackner, M. (2017). Preferences Single-Peaked on a Circle. Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), 649–655. https://doi.org/10.1609/aaai.v31i1.10615

Bruner, M.-L., & Lackner, M. (2016). A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. Algorithmica, 75(1), 84–117. https://dx.doi.org/10.1007/s00453-015-0013-y

Elkind, E., Lackner, M., & Peters, D. (2016). Preference Restrictions in Computational Social Choice: Recent Progress. Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), Early Career Spotlight Track, 4062–4065.

Bibtex

Albert, M. H., Lackner, M.-L., Lackner, M., & Vatter, V. (2016). The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations. Discrete Mathematics and Theoretical Computer Science, 18 nos. 2, Permutation Patterns 2015. https://doi.org/10.46298/dmtcs.1308

Erdélyi, G., Lackner, M., & Pfandler, A. (2015). Manipulation of k-Approval in Nearly Single-Peaked Electorates. In T. Walsh (Ed.), Proceedings of the 4th International Conference on Algorithmic Decision Theory (ADT 2015) (Vol. 9346, pp. 71–85). Springer International Publishing. https://dx.doi.org/10.1007/978-3-319-23114-3_5

Elkind, E., Faliszewski, P., Lackner, M., & Obraztsova, S. (2015). The Complexity of Recognizing Incomplete Single-Crossing Preferences. Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), 865–871. https://doi.org/10.1609/aaai.v29i1.9321

Elkind, E., & Lackner, M. (2015). Structure in Dichotomous Preferences. Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), 2019–2025.

Bibtex

Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). A Parameterized Complexity Analysis of Generalized CP-Nets. Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), 1091–1097. https://doi.org/10.1609/aaai.v28i1.8859

Elkind, E., & Lackner, M. (2014). On Detecting Nearly Structured Preference Profiles. Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), 661–667. https://doi.org/10.1609/aaai.v28i1.8823

Lackner, M. (2014). Incomplete Preferences in Single-Peaked Electorates. Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), 742–748. https://doi.org/10.1609/aaai.v28i1.8822

Lackner, M. (2014). Detecting Structure in Permutations and Preferences [PhD Thesis]. Vienna University of Technology.

Bibtex

Erdélyi, G., Lackner, M., & Pfandler, A. (2013). Computational Aspects of Nearly Single-Peaked Electorates. Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI 2013), 283–289.

Bibtex

Bruner, M.-L., & Lackner, M. (2013). The Computational Landscape of Permutation Patterns. Pure Mathematics and Applications: Special Issue for the Permutation Patterns 2012 Conference, 24(2), 83–101.

Bibtex

Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Closed World Reasoning. In L. D. Raedt, C. Bessière, D. Dubois, P. Doherty, P. Frasconi, F. Heintz, & P. J. F. Lucas (Eds.), Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012) (pp. 492–497). IOS Press. https://dx.doi.org/10.3233/978-1-61499-098-7-492

Lackner, M., Pichler, R., Rümmele, S., & Woltran, S. (2012). Multicut on Graphs of Bounded Clique-Width. In G. Lin (Ed.), Proceedings of the 6th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2012) (Vol. 7402, pp. 115–126). Springer Berlin / Heidelberg. https://dx.doi.org/10.1007/978-3-642-31770-5_11

Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Finding Minimal Models. In G. Brewka, T. Eiter, & S. A. McIlraith (Eds.), Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012) (pp. 85–95). AAAI Press.

Bibtex

Brueggeman, L., Fellows, M. R., Fleischer, R., Lackner, M., Komusiewicz, C., Koutis, Y., Pfandler, A., & Rosamond, F. A. (2012). Train Marshalling Is Fixed Parameter Tractable. In E. Kranakis, D. Krizanc, & F. Luccio (Eds.), Proceedings of the Sixth International Conference on Fun with Algorithms (FUN 2012) (Vol. 7288, pp. 51–56). Springer Berlin / Heidelberg. https://dx.doi.org/10.1007/978-3-642-30347-0_8

Bruner, M.-L., & Lackner, M. (2012). A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. In F. Fomin & P. Kaski (Eds.), Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012) (Vol. 7357, pp. 261–270). Springer Berlin / Heidelberg. https://dx.doi.org/10.1007/978-3-642-31155-0_23

Bruner, M.-L., & Lackner, M. (2012). From Peaks to Valleys, Running Up and Down: Fast Permutation Pattern Matching. TinyToCS, Vol. 1.

Bibtex