Martin Lackner

Peter Regner

Benjamin Krenn

J. Open Source Softw., January, 2023

Multi-Winner Voting with Approval Preferences - Artificial Intelligence, Multiagent Systems, and Cognitive Robotics

[BibT_eX]

[DOI]

Springer Briefs in Intelligent Systems, Springer, ISBN: 978-3-031-09015-8, 2023

An Experimental Comparison of Multiwinner Voting Rules on Approval Elections.

[BibT_eX]

[DOI]

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

Free-Riding in Multi-Issue Decisions.

[BibT_eX]

[DOI]

Oliviero Nardi

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

Fairness in Participatory Budgeting via Equality of Resources.

[BibT_eX]

[DOI]

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

Proportional Decisions in Perpetual Voting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI 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

2022

Preference Restrictions in Computational Social Choice: A Survey.

[BibT_eX]

[DOI]

Dominik Peters

CoRR, 2022

Effort-Based Fairness for Participatory Budgeting.

[BibT_eX]

[DOI]

CoRR, 2022

How to Sample Approval Elections?

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Liquid Democracy with Ranked Delegations.

[BibT_eX]

[DOI]

Ulrike Schmidt-Kraepelin

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

Participatory Budgeting with Donations and Diversity Constraints.

[BibT_eX]

[DOI]

Jiehua Chen

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

2021

Consistent approval-based multi-winner rules.

[BibT_eX]

[DOI]

J. Econ. Theory, 2021

Perpetual Voting: The Axiomatic Lens.

[BibT_eX]

[DOI]

CoRR, 2021

Fairness in Long-Term Participatory Budgeting.

[BibT_eX]

[DOI]

Simon Rey

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

Approval-Based Shortlisting.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Computing Kemeny Rankings from d-Euclidean Preferences.

[BibT_eX]

[DOI]

Thekla Hamm

Anna Rapberger

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

2020

Preferences Single-Peaked on a Circle.

[BibT_eX]

[DOI]

Dominik Peters

J. Artif. Intell. Res., 2020

Incomplete Preferences in Single-Peaked Electorates.

[BibT_eX]

[DOI]

Zack Fitzsimmons

J. Artif. Intell. Res., 2020

Approval-Based Committee Voting: Axioms, Algorithms, and Applications.

[BibT_eX]

[DOI]

CoRR, 2020

Utilitarian welfare and representation guarantees of approval-based multiwinner rules.

[BibT_eX]

[DOI]

Artif. Intell., 2020

Strategic Campaign Management in Apportionment Elections.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Perpetual Voting: Fairness in Long-Term Decision Making.

[BibT_eX]

[DOI]

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

Proportional Belief Merging.

[BibT_eX]

[DOI]

Adrian Haret

Johannes Peter Wallner

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

2019

A Mathematical Analysis of an Election System Proposed by Gottlob Frege.

[BibT_eX]

[DOI]

Paul Harrenstein

Marie-Louise Lackner

CoRR, 2019

A Quantitative Analysis of Multi-Winner Rules.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

On Rational Delegations in Liquid Democracy.

[BibT_eX]

[DOI]

Daan Bloembergen

Davide Grossi

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Approval-Based Multi-Winner Rules and Strategic Voting.

[BibT_eX]

[DOI]

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

Computing the Schulze Method for Large-Scale Preference Data Sets.

[BibT_eX]

[DOI]

Theresa Csar

Reinhard Pichler

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

Effective Heuristics for Committee Scoring Rules.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Multiwinner Elections With Diversity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

On the Complexity of Extended and Proportional Justified Representation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

On the likelihood of single-peaked preferences.

[BibT_eX]

[DOI]

Marie-Louise Lackner

Soc. Choice Welf., 2017

Computational Aspects of Nearly Single-Peaked Electorates.

[BibT_eX]

[DOI]

Gábor Erdélyi

J. Artif. Intell. Res., 2017

Optimal Average Satisfaction and Extended Justified Representation in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2017

Committees providing EJR can be computed efficiently.

[BibT_eX]

[DOI]

CoRR, 2017

Proportional Rankings.

[BibT_eX]

[DOI]

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

The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality.

[BibT_eX]

[DOI]

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

Computational Social Choice in the Clouds.

[BibT_eX]

[DOI]

Proceedings of the Datenbanksysteme für Business, 2017

Proportional Justified Representation.

[BibT_eX]

[DOI]

Norberto Fernández García

Jesús Arias-Fisteus

Pablo Basanta-Val

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

Winner Determination in Huge Elections with MapReduce.

[BibT_eX]

[DOI]

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

2016

The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs.

[BibT_eX]

[DOI]

Algorithmica, 2016

Preference Restrictions in Computational Social Choice: Recent Progress.

[BibT_eX]

[DOI]

Dominik Peters

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

2015

Structure in Dichotomous Preferences.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Manipulation of k-Approval in Nearly Single-Peaked Electorates.

[BibT_eX]

[DOI]

Gábor Erdélyi

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

The Complexity of Recognizing Incomplete Single-Crossing Preferences.

[BibT_eX]

[DOI]

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

2014

Incomplete Preferences in Single-Peaked Electorates.

[BibT_eX]

[DOI]

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

A Parameterized Complexity Analysis of Generalized CP-Nets.

[BibT_eX]

[DOI]

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

On Detecting Nearly Structured Preference Profiles.

[BibT_eX]

[DOI]

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

The Likelihood of Structure in Preference Profiles.

[BibT_eX]

[DOI]

Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013

The computational landscape of permutation patterns

[BibT_eX]

[DOI]

CoRR, 2013

2012

From Peaks to Valleys, Running Up and Down: Fast Permutation Pattern Matching.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2012

Fixed-Parameter Algorithms for Finding Minimal Models.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Train Marshalling Is Fixed Parameter Tractable.

[BibT_eX]

[DOI]

Christian Komusiewicz

Yiannis Koutis

Frances A. Rosamond

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Fixed-Parameter Algorithms for Closed World Reasoning.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

Multicut on Graphs of Bounded Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

A W[1]-Completeness Result for Generalized Permutation Pattern Matching

[BibT_eX]

[DOI]

CoRR, 2011

2002

Supporting Design by Contract in Java.

[BibT_eX]

[DOI]