default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Lackner
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Markus Brill
, Rupert Freeman, Svante Janson, Martin Lackner:
Phragmén's voting methods and justified representation. Math. Program. 203(1): 47-76 (2024)- [c45]Ayumi Igarashi, Martin Lackner, Oliviero Nardi, Arianna Novaro:
Repeated Fair Allocation of Indivisible Items. AAAI 2024: 9781-9789 - [i33]Piotr Faliszewski, Martin Lackner, Krzysztof Sornat, Stanislaw Szufa:
An Experimental Comparison of Multiwinner Voting Rules on Approval Elections. CoRR abs/2401.11870 (2024) - [i32]Davide Grossi, Ulrike Hahn, Michael Mäs, Andreas Nitsche, Jan Behrens, Niclas Boehmer, Markus Brill, Ulle Endriss, Umberto Grandi, Adrian Haret, Jobst Heitzig, Nicolien Janssens, Catholijn M. Jonker, Marijn A. Keijzer, Axel Kistner, Martin Lackner, Alexandra Lieben, Anna Mikhaylovskaya, Pradeep K. Murukannaiah, Carlo Proietti, Manon Revel, Élise Rouméas, Ehud Shapiro, Gogulapati Sreedurga, Björn Swierczek, Nimrod Talmon, Paolo Turrini, Zoi Terzopoulou, Frederik Van De Putte:
Enabling the Digital Democratic Revival: A Research Program for Digital Democracy. CoRR abs/2401.16863 (2024) - 2023
- [b1]Martin Lackner, Piotr Skowron:
Multi-Winner Voting with Approval Preferences - Artificial Intelligence, Multiagent Systems, and Cognitive Robotics. Springer Briefs in Intelligent Systems, Springer 2023, ISBN 978-3-031-09015-8, pp. 1-110 - [j10]Martin Lackner, Peter Regner, Benjamin Krenn:
abcvoting: A Python package for approval-based multi-winner voting rules. J. Open Source Softw. 8(81): 4880 (2023) - [c44]Markus Brill, Stefan Forster, Martin Lackner, Jan Maly, Jannik Peters:
Proportionality in Approval-Based Participatory Budgeting. AAAI 2023: 5524-5531 - [c43]Martin Lackner, Jan Maly:
Proportional Decisions in Perpetual Voting. AAAI 2023: 5722-5729 - [c42]Jan Maly, Simon Rey, Ulle Endriss, Martin Lackner:
Fairness in Participatory Budgeting via Equality of Resources. AAMAS 2023: 2031-2039 - [c41]Martin Lackner, Jan Maly, Oliviero Nardi:
Free-Riding in Multi-Issue Decisions. AAMAS 2023: 2040-2048 - [c40]Piotr Faliszewski, Martin Lackner, Krzysztof Sornat, Stanislaw Szufa:
An Experimental Comparison of Multiwinner Voting Rules on Approval Elections. IJCAI 2023: 2675-2683 - [i31]Markus Brill, Stefan Forster, Martin Lackner, Jan Maly, Jannik Peters:
Proportionality in Approval-Based Participatory Budgeting. CoRR abs/2302.03672 (2023) - [i30]Ayumi Igarashi, Martin Lackner, Oliviero Nardi, Arianna Novaro:
Repeated Fair Allocation of Indivisible Items. CoRR abs/2304.01644 (2023) - [i29]Martin Lackner, Jan Maly, Oliviero Nardi:
Free-Riding in Multi-Issue Decisions. CoRR abs/2310.08194 (2023) - 2022
- [c39]Markus Brill, Théo Delemazure, Anne-Marie George, Martin Lackner, Ulrike Schmidt-Kraepelin:
Liquid Democracy with Ranked Delegations. AAAI 2022: 4884-4891 - [c38]Jiehua Chen, Martin Lackner, Jan Maly:
Participatory Budgeting with Donations and Diversity Constraints. AAAI 2022: 9323-9330 - [c37]Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko, Martin Lackner, Arkadii Slinko, Krzysztof Sornat, Nimrod Talmon:
How to Sample Approval Elections? IJCAI 2022: 496-502 - [i28]Jan Maly, Simon Rey, Ulle Endriss, Martin Lackner:
Effort-Based Fairness for Participatory Budgeting. CoRR abs/2205.07517 (2022) - [i27]Edith Elkind, Martin Lackner, Dominik Peters:
Preference Restrictions in Computational Social Choice: A Survey. CoRR abs/2205.09092 (2022) - [i26]Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko, Martin Lackner, Arkadii Slinko, Krzysztof Sornat, Nimrod Talmon:
How to Sample Approval Elections? CoRR abs/2207.01140 (2022) - 2021
- [j9]Martin Lackner, Piotr Skowron:
Consistent approval-based multi-winner rules. J. Econ. Theory 192: 105173 (2021) - [c36]Thekla Hamm, Martin Lackner, Anna Rapberger:
Computing Kemeny Rankings from d-Euclidean Preferences. ADT 2021: 147-161 - [c35]Martin Lackner, Jan Maly:
Approval-Based Shortlisting. AAMAS 2021: 737-745 - [c34]Martin Lackner, Jan Maly, Simon Rey:
Fairness in Long-Term Participatory Budgeting. AAMAS 2021: 1566-1568 - [c33]Martin Lackner, Jan Maly, Simon Rey:
Fairness in Long-Term Participatory Budgeting. IJCAI 2021: 299-305 - [i25]Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner:
Phragmén's Voting Methods and Justified Representation. CoRR abs/2102.12305 (2021) - [i24]Martin Lackner, Jan Maly:
Perpetual Voting: The Axiomatic Lens. CoRR abs/2104.15058 (2021) - [i23]Jiehua Chen, Martin Lackner, Jan Maly:
Participatory Budgeting with Donations and Diversity Constraints. CoRR abs/2104.15075 (2021) - [i22]Markus Brill, Théo Delemazure, Anne-Marie George, Martin Lackner, Ulrike Schmidt-Kraepelin:
Liquid Democracy with Ranked Delegations. CoRR abs/2112.07509 (2021) - 2020
- [j8]Martin Lackner, Piotr Skowron:
Utilitarian welfare and representation guarantees of approval-based multiwinner rules. Artif. Intell. 288: 103366 (2020) - [j7]Zack Fitzsimmons, Martin Lackner:
Incomplete Preferences in Single-Peaked Electorates. J. Artif. Intell. Res. 67: 797-833 (2020) - [j6]Dominik Peters, Martin Lackner:
Preferences Single-Peaked on a Circle. J. Artif. Intell. Res. 68: 463-502 (2020) - [c32]Martin Lackner:
Perpetual Voting: Fairness in Long-Term Decision Making. AAAI 2020: 2103-2110 - [c31]Adrian Haret, Martin Lackner, Andreas Pfandler, Johannes Peter Wallner:
Proportional Belief Merging. AAAI 2020: 2822-2829 - [c30]Robert Bredereck, Piotr Faliszewski, Michal Furdyna, Andrzej Kaczmarczyk, Martin Lackner:
Strategic Campaign Management in Apportionment Elections. IJCAI 2020: 103-109 - [i21]Martin Lackner, Jan Maly:
Approval-Based Shortlisting. CoRR abs/2005.07094 (2020) - [i20]Martin Lackner, Piotr Skowron:
Approval-Based Committee Voting: Axioms, Algorithms, and Applications. CoRR abs/2007.01795 (2020)
2010 – 2019
- 2019
- [c29]Daan Bloembergen, Davide Grossi, Martin Lackner:
On Rational Delegations in Liquid Democracy. AAAI 2019: 1796-1803 - [c28]Martin Lackner, Piotr Skowron:
A Quantitative Analysis of Multi-Winner Rules. IJCAI 2019: 407-413 - [i19]Zack Fitzsimmons, Martin Lackner:
Incomplete Preferences in Single-Peaked Electorates. CoRR abs/1907.00752 (2019) - [i18]Paul Harrenstein, Marie-Louise Lackner, Martin Lackner:
A Mathematical Analysis of an Election System Proposed by Gottlob Frege. CoRR abs/1907.03643 (2019) - 2018
- [c27]Haris Aziz, Edith Elkind, Shenwei Huang, Martin Lackner, Luis Sánchez Fernández, Piotr Skowron:
On the Complexity of Extended and Proportional Justified Representation. AAAI 2018: 902-909 - [c26]Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron:
Multiwinner Elections With Diversity Constraints. AAAI 2018: 933-940 - [c25]Piotr Faliszewski, Martin Lackner, Dominik Peters, Nimrod Talmon:
Effective Heuristics for Committee Scoring Rules. AAAI 2018: 1023-1030 - [c24]Theresa Csar, Martin Lackner, Reinhard Pichler:
Computing the Schulze Method for Large-Scale Preference Data Sets. IJCAI 2018: 180-187 - [c23]Martin Lackner, Piotr Skowron:
Approval-Based Multi-Winner Rules and Strategic Voting. IJCAI 2018: 340-346 - [c22]Martin Lackner, Piotr Skowron:
Consistent Approval-Based Multi-Winner Rules. EC 2018: 47-48 - [i17]Martin Lackner, Piotr Skowron:
A Quantitative Analysis of Multi-Winner Rules. CoRR abs/1801.01527 (2018) - [i16]Daan Bloembergen, Davide Grossi, Martin Lackner:
On Rational Delegations in Liquid Democracy. CoRR abs/1802.08020 (2018) - 2017
- [j5]Gábor Erdélyi, Martin Lackner, Andreas Pfandler:
Computational Aspects of Nearly Single-Peaked Electorates. J. Artif. Intell. Res. 58: 297-337 (2017) - [j4]Marie-Louise Lackner, Martin Lackner:
On the likelihood of single-peaked preferences. Soc. Choice Welf. 48(4): 717-745 (2017) - [c21]Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner:
Phragmén's Voting Methods and Justified Representation. AAAI 2017: 406-413 - [c20]Theresa Csar, Martin Lackner, Reinhard Pichler, Emanuel Sallinger:
Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458 - [c19]Dominik Peters, Martin Lackner:
Preferences Single-Peaked on a Circle. AAAI 2017: 649-655 - [c18]Luis Sánchez Fernández, Edith Elkind, Martin Lackner, Norberto Fernández García, Jesús Arias-Fisteus, Pablo Basanta-Val, Piotr Skowron:
Proportional Justified Representation. AAAI 2017: 670-676 - [c17]Theresa Csar, Martin Lackner, Reinhard Pichler, Emanuel Sallinger:
Computational Social Choice in the Clouds. BTW (Workshops) 2017: 163-167 - [c16]Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner, Piotr Skowron:
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality. IJCAI 2017: 84-90 - [c15]Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, Edith Elkind:
Proportional Rankings. IJCAI 2017: 409-415 - [i15]Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner, Piotr Skowron:
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality. CoRR abs/1701.08023 (2017) - [i14]Piotr Skowron, Martin Lackner, Edith Elkind, Luis Sánchez Fernández:
Optimal Average Satisfaction and Extended Justified Representation in Polynomial Time. CoRR abs/1704.00293 (2017) - [i13]Luis Sánchez Fernández, Edith Elkind, Martin Lackner:
Committees providing EJR can be computed efficiently. CoRR abs/1704.00356 (2017) - [i12]Martin Lackner, Piotr Skowron:
Consistent Approval-Based Multi-Winner Rules. CoRR abs/1704.02453 (2017) - [i11]Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron:
Multiwinner Elections with Diversity Constraints. CoRR abs/1711.06527 (2017) - 2016
- [j3]Marie-Louise Bruner, Martin Lackner:
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. Algorithmica 75(1): 84-117 (2016) - [j2]Michael H. Albert, Marie-Louise Lackner, Martin Lackner, Vincent Vatter:
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [c14]Edith Elkind, Martin Lackner, Dominik Peters:
Preference Restrictions in Computational Social Choice: Recent Progress. IJCAI 2016: 4062-4065 - [i10]Luis Sánchez Fernández, Edith Elkind, Martin Lackner, Norberto Fernández García, Jesús A. Fisteus, Pablo Basanta-Val, Piotr Skowron:
Proportional Justified Representation. CoRR abs/1611.09928 (2016) - [i9]Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, Edith Elkind:
Proportional Rankings. CoRR abs/1612.01434 (2016) - 2015
- [c13]Edith Elkind, Piotr Faliszewski, Martin Lackner, Svetlana Obraztsova:
The Complexity of Recognizing Incomplete Single-Crossing Preferences. AAAI 2015: 865-871 - [c12]Gábor Erdélyi, Martin Lackner, Andreas Pfandler:
Manipulation of k-Approval in Nearly Single-Peaked Electorates. ADT 2015: 71-85 - [c11]Edith Elkind, Martin Lackner:
Structure in Dichotomous Preferences. IJCAI 2015: 2019-2025 - [i8]Edith Elkind, Martin Lackner:
Structure in Dichotomous Preferences. CoRR abs/1505.00341 (2015) - [i7]Marie-Louise Bruner, Martin Lackner:
On the Likelihood of Single-Peaked Preferences. CoRR abs/1505.05852 (2015) - [i6]Michael H. Albert, Marie-Louise Lackner, Martin Lackner, Vincent Vatter:
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations. CoRR abs/1510.06051 (2015) - 2014
- [c10]Marie-Louise Bruner, Martin Lackner:
The Likelihood of Structure in Preference Profiles. MPREF@AAAI 2014 - [c9]Edith Elkind, Martin Lackner:
On Detecting Nearly Structured Preference Profiles. AAAI 2014: 661-667 - [c8]Martin Lackner:
Incomplete Preferences in Single-Peaked Electorates. AAAI 2014: 742-748 - [c7]Martin Kronegger, Martin Lackner, Andreas Pfandler, Reinhard Pichler:
A Parameterized Complexity Analysis of Generalized CP-Nets. AAAI 2014: 1091-1097 - 2013
- [c6]Gábor Erdélyi, Martin Lackner, Andreas Pfandler:
Computational Aspects of Nearly Single-Peaked Electorates. AAAI 2013: 283-289 - [i5]Marie-Louise Bruner, Martin Lackner:
The computational landscape of permutation patterns. CoRR abs/1301.0340 (2013) - 2012
- [c5]Martin Lackner, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Multicut on Graphs of Bounded Clique-Width. COCOA 2012: 115-126 - [c4]Martin Lackner, Andreas Pfandler:
Fixed-Parameter Algorithms for Closed World Reasoning. ECAI 2012: 492-497 - [c3]Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond:
Train Marshalling Is Fixed Parameter Tractable. FUN 2012: 51-56 - [c2]Martin Lackner, Andreas Pfandler:
Fixed-Parameter Algorithms for Finding Minimal Models. KR 2012 - [c1]Marie-Louise Bruner, Martin Lackner:
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. SWAT 2012: 261-270 - [i4]Marie-Louise Bruner, Martin Lackner:
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. CoRR abs/1204.5224 (2012) - [i3]Gábor Erdélyi, Martin Lackner, Andreas Pfandler:
Computational Aspects of Nearly Single-Peaked Electorates. CoRR abs/1211.2627 (2012) - [i2]Marie-Louise Bruner, Martin Lackner:
From Peaks to Valleys, Running Up and Down: Fast Permutation Pattern Matching. Adv. Math. Commun. 1 (2012) - 2011
- [i1]Marie-Louise Bruner, Martin Lackner:
A W[1]-Completeness Result for Generalized Permutation Pattern Matching. CoRR abs/1109.1951 (2011)
2000 – 2009
- 2002
- [j1]Martin Lackner, Andreas Krall, Franz Puntigam:
Supporting Design by Contract in Java. J. Object Technol. 1(3): 57-76 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-16 22:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
