Markus Brill

Math. Program., January, 2024

Approval-based apportionment.

[BibT_eX]

[DOI]

Paul Gölz

Dominik Peters

Kai Wilker

Math. Program., January, 2024

Phragmén's voting methods and justified representation.

[BibT_eX]

[DOI]

Math. Program., January, 2024

Enabling the Digital Democratic Revival: A Research Program for Digital Democracy.

[BibT_eX]

[DOI]

CoRR, 2024

Spatial Voting with Incomplete Voter Information.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Completing Priceable Committees: Utilitarian and Representation Guarantees for Proportional Multiwinner Voting.

[BibT_eX]

[DOI]

Jannik Peters

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Approval-Based Committee Voting in Practice: A Case Study of (over-)Representation in the Polkadot Blockchain.

[BibT_eX]

[DOI]

Luis Sánchez Fernández

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Selecting Representative Bodies: An Axiomatic View.

[BibT_eX]

[DOI]

CoRR, 2023

Finding Possible and Necessary Winners in Spatial Voting with Partial Information.

[BibT_eX]

[DOI]

CoRR, 2023

Robust and Verifiable Proportionality Axioms for Multiwinner Voting.

[BibT_eX]

[DOI]

Jannik Peters

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Proportionality Guarantees in Elections with Interdependent Issues.

[BibT_eX]

[DOI]

Georgios Papasotiropoulos

Evangelos Markakis

Jannik Peters

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Proportionality in Approval-Based Participatory Budgeting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Multiwinner Voting with Possibly Unavailable Candidates.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Algorithms for Participatory Democracy (Dagstuhl Seminar 22271).

[BibT_eX]

[DOI]

Dagstuhl Reports, July, 2022

The excess method: a multiwinner approval voting procedure to allocate wasted votes.

[BibT_eX]

[DOI]

Steven J. Brams

Anne-Marie George

Soc. Choice Welf., 2022

Margin of victory for tournament solutions.

[BibT_eX]

[DOI]

Artif. Intell., 2022

Proportional Representation in Matching Markets: Selecting Multiple Matchings under Dichotomous Preferences.

[BibT_eX]

[DOI]

Niclas Boehmer

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Approval-Based Committee Voting under Incomplete Information.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Individual Representation in Approval-Based Committee Voting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Liquid Democracy with Ranked Delegations.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Committee Voting with Incomplete Approvals.

[BibT_eX]

[DOI]

CoRR, 2021

Selecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space.

[BibT_eX]

[DOI]

Niclas Boehmer

CoRR, 2021

Dynamic Proportional Rankings.

[BibT_eX]

[DOI]

Jonas Israel

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

From Computational Social Choice to Digital Democracy.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Margin of Victory in Tournaments: Structural and Experimental Results.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

On the Structure of Stable Tournament Solutions.

[BibT_eX]

[DOI]

CoRR, 2020

Refining Tournament Solutions via Margin of Victory.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Exact mean computation in dynamic time warping spaces.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2019

Approximation Algorithms for BalancedCC Multiwinner Rules.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Extending tournament solutions.

[BibT_eX]

[DOI]

Paul Harrenstein

Soc. Choice Welf., 2018

On the tradeoff between efficiency and strategyproofness.

[BibT_eX]

[DOI]

Games Econ. Behav., 2018

Pairwise Liquid Democracy.

[BibT_eX]

[DOI]

Nimrod Talmon

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Interactive Democracy.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Computing Dominance-Based Solution Concepts.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2017

Justified representation in approval-based committee voting.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2017

Proportional Rankings.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Multiwinner Approval Rules as Apportionment Methods.

[BibT_eX]

[DOI]

Jean-François Laslier

Piotr Skowron

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Tournament Solutions.

[BibT_eX]

[DOI]

Paul Harrenstein

Proceedings of the Handbook of Computational Social Choice, 2016

An ordinal minimax theorem.

[BibT_eX]

[DOI]

Games Econ. Behav., 2016

False-Name-Proof Recommendations in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Pairwise Diffusion of Preference Rankings in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Rules for Choosing Societal Tradeoffs.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners).

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

Possible and Necessary Winners of Partial Tournaments.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

General Tiebreaking Schemes for Computational Social Choice.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Crowdsourcing Societal Tradeoffs.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Strategic Voting and Strategic Candidacy.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Computational aspects of random serial dictatorship.

[BibT_eX]

[DOI]

SIGecom Exch., 2014

Minimal retentive sets in tournaments.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2014

On the Axiomatic Characterization of Runoff Voting Rules.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Testing substitutability of weak preferences.

[BibT_eX]

[DOI]

Haris Aziz

Paul Harrenstein

Math. Soc. Sci., 2013

The Computational Complexity of Random Serial Dictatorship.

[BibT_eX]

[DOI]

Haris Aziz

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

On the tradeoff between economic efficiency and strategy proofness in randomized social choice.

[BibT_eX]

[DOI]

Haris Aziz

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012

Set-Valued Solution Concepts in Social Choice and Game Theory: Axiomatic and Computational Aspects.

[BibT_eX]

[DOI]

PhD thesis, 2012

Mengenwertige Lösungskonzepte in Spieltheorie und Social-Choice-Theorie.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2012, 2012

The Price of Neutrality for the Ranked Pairs Method.

[BibT_eX]

[DOI]

Felix A. Fischer

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

On the Complexity of Iterated Weak Dominance in Constant-Sum Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

The Computational Complexity of Weak Saddles.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions.

[BibT_eX]

[DOI]

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions.

[BibT_eX]

[DOI]