Felix Brandt

René Romen

Soc. Choice Welf., August, 2024

On the Convergence of Swap Dynamics to Pareto-Optimal Matchings.

[BibT_eX]

[DOI]

Anaëlle Wilczynski

J. Artif. Intell. Res., 2024

Weak Strategyproofness in Randomized Social Choice.

[BibT_eX]

[DOI]

CoRR, 2024

Condorcet-Consistent Choice Among Three Candidates.

[BibT_eX]

[DOI]

Chris Dong

Dominik Peters

CoRR, 2024

Stability based on single-agent deviations in additively separable hedonic games.

[BibT_eX]

[DOI]

Leo Tappe

Artif. Intell., 2024

Optimal Budget Aggregation with Single-Peaked Preferences.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

2023

Incentives in social decision schemes with pairwise comparison preferences.

[BibT_eX]

[DOI]

Warut Suksompong

Games Econ. Behav., November, 2023

Reaching Individually Stable Coalition Structures.

[BibT_eX]

[DOI]

Anaëlle Wilczynski

ACM Trans. Economics and Comput., 2023

A Robust Characterization of Nash Equilibrium.

[BibT_eX]

[DOI]

CoRR, 2023

Balanced Donor Coordination.

[BibT_eX]

[DOI]

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

Strategyproof Social Decision Schemes on Super Condorcet Domains.

[BibT_eX]

[DOI]

Sascha Tausch

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

2022

An analytical and experimental comparison of maximal lottery schemes.

[BibT_eX]

[DOI]

Christian Stricker

Soc. Choice Welf., 2022

Strategyproof social choice when preferences and outcomes may contain ties.

[BibT_eX]

[DOI]

Christian Saile

Christian Stricker

J. Econ. Theory, 2022

On the Indecisiveness of Kelly-Strategyproof Social Choice Functions.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Finding and Recognizing Popular Coalition Structures.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Single-Agent Dynamics in Additively Separable Hedonic Games.

[BibT_eX]

[DOI]

Leo Tappe

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

2021

Characterizing the Top Cycle via Strategyproofness.

[BibT_eX]

[DOI]

CoRR, 2021

Funding Public Projects: A Case for the Nash Product Rule.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Distribution Rules Under Dichotomous Preferences: Two Out of Three Ain't Bad.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Reaching Individually Stable Coalition Structures in Hedonic Games.

[BibT_eX]

[DOI]

Anaëlle Wilczynski

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

2020

Funding Public Projects: A Case for the Nash Product Rule.

[BibT_eX]

[DOI]

CoRR, 2020

On the Structure of Stable Tournament Solutions.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Computational Social Choice: The First Ten Years and Beyond.

[BibT_eX]

[DOI]

Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

Fractional Hedonic Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2019

<i>k</i>-Majority digraphs and the hardness of voting with a constant number of voters.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Strategic Abstention based on Preference Extensions: Positive Results and Computer-Generated Impossibilities.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2019

Welfare maximization entices participation.

[BibT_eX]

[DOI]

Games Econ. Behav., 2019

Exploring the No-Show Paradox for Condorcet Extensions Using Ehrhart Theory and Computer Simulations.

[BibT_eX]

[DOI]

Martin Strobel

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

2018

Extending tournament solutions.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2018

Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving.

[BibT_eX]

[DOI]

J. ACM, 2018

On the tradeoff between efficiency and strategyproofness.

[BibT_eX]

[DOI]

Games Econ. Behav., 2018

The Incompatibility of Fishburn-Strategyproofness and Pareto-Efficiency.

[BibT_eX]

[DOI]

Arch. Formal Proofs, 2018

Voting with Ties: Strong Impossibilities via SAT Solving.

[BibT_eX]

[DOI]

Christian Saile

Christian Stricker

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

Optimal bounds for the no-show paradox via SAT solving.

[BibT_eX]

[DOI]

Dominik Peters

Math. Soc. Sci., 2017

Minimal extending sets in tournaments.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2017

Algorithmic Economics und Operations Research.

[BibT_eX]

[DOI]

Inform. Spektrum, 2017

Arrovian Aggregation via Pairwise Utilitarianism.

[BibT_eX]

[DOI]

CoRR, 2017

k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters.

[BibT_eX]

[DOI]

CoRR, 2017

Random Assignment with Optional Participation.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Majority Graphs of Assignment Problems and Properties of Popular Random Assignments.

[BibT_eX]

[DOI]

Martin Suderland

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Algorithmic Economics und Operations Research.

[BibT_eX]

[DOI]

Proceedings of the 50 Jahre Universitäts-Informatik in München, 2017

2016

Introduction to Computational Social Choice.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computational Social Choice, 2016

Tournament Solutions.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computational Social Choice, 2016

A note on the McKelvey uncovered set and Pareto optimality.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2016

Finding Strategyproof Social Choice Functions via SAT Solving.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

An ordinal minimax theorem.

[BibT_eX]

[DOI]

Warut Suksompong

Games Econ. Behav., 2016

Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving.

[BibT_eX]

[DOI]

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

Analyzing the Practical Relevance of Voting Paradoxes via Ehrhart Theory, Computer Simulations, and Empirical Data.

[BibT_eX]

[DOI]

Martin Strobel

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Set-monotonicity implies Kelly-strategyproofness.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2015

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

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

Bounds on the disparity and separation of tournament solutions.

[BibT_eX]

[DOI]

Andre Dau

Discret. Appl. Math., 2015

The Impossibility of Extending Random Dictatorship to Weak Preferences.

[BibT_eX]

[DOI]

Warut Suksompong

CoRR, 2015

Consistent Probabilistic Social Choice.

[BibT_eX]

[DOI]

CoRR, 2015

Computational Social Choice (Tutorial).

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Pnyx: : A Powerful and User-friendly Tool for Preference Aggregation.

[BibT_eX]

[DOI]

Guillaume Chabin

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

Fractional Hedonic Games: Individual and Group Stability.

[BibT_eX]

[DOI]

Martin Strobel

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

Incentives for Participation and Abstention in Probabilistic Social Choice.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 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

Universal pareto dominance and welfare for plausible utility functions.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Economics and Computation, 2014

On the Discriminative Power of Tournament Solutions.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2014, 2014

Fractional hedonic games.

[BibT_eX]

[DOI]

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

On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice.

[BibT_eX]

[DOI]

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

2013

A counterexample to a conjecture of Schwartz.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2013

On the Rate of Convergence of Fictitious Play.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

The Complexity of Computing Minimal Unidirectional Covering Sets.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Pareto optimality in coalition formation.

[BibT_eX]

[DOI]

Games Econ. Behav., 2013

A tournament of order 24 with two disjoint TEQ-retentive sets

[BibT_eX]

[DOI]

CoRR, 2013

Computing desirable partitions in additively separable hedonic games.

[BibT_eX]

[DOI]

Artif. Intell., 2013

The Computational Complexity of Random Serial Dictatorship.

[BibT_eX]

[DOI]

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

On Popular Random Assignments.

[BibT_eX]

[DOI]

Paul Stursberg

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

It only takes a few: on the hardness of voting with a constant number of agents.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

2012

Special Issue on Computational Foundations of Social Choice.

[BibT_eX]

[DOI]

William S. Zwicker

Math. Soc. Sci., 2012

2011

Equilibria of graphical games with symmetries.

[BibT_eX]

[DOI]

Markus Holzer

Theor. Comput. Sci., 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

Set-rationalizable choice and self-stability.

[BibT_eX]

[DOI]

J. Econ. Theory, 2011

Minimal stable sets in tournaments.

[BibT_eX]

[DOI]

J. Econ. Theory, 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]

Proceedings of the IJCAI 2011, 2011

Group-Strategyproof Irresolute Social Choice Functions.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

Optimal Partitions in Additively Separable Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

Stable partitions in additively separable hedonic games.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

From Arrow's Impossibility to Schwartz's Tournament Equilibrium Set - (Invited Tutorial).

[BibT_eX]

[DOI]

Proceedings of the Relational and Algebraic Methods in Computer Science, 2011

2010

Auctions.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Financial Cryptography and Security., 2010

A computational analysis of the tournament equilibrium set.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2010

Tournament Solutions and Their Applications to Multiagent Decision Making.

[BibT_eX]

[DOI]

Proceedings of the Multiagent System Technologies, 8th German Conference, 2010

10101 Executive Summary - Computational Foundations of Social Choice.

[BibT_eX]

[DOI]

Vincent Conitzer

Lane A. Hemaspaandra

Jean-François Laslier

William S. Zwicker

Proceedings of the Computational Foundations of Social Choice, 07.03. - 12.03.2010, 2010

10101 Abstracts Collection - Computational Foundations of Social Choice.

[BibT_eX]

[DOI]

Vincent Conitzer

Lane A. Hemaspaandra

Jean-François Laslier

William S. Zwicker

Proceedings of the Computational Foundations of Social Choice, 07.03. - 12.03.2010, 2010

Monotone cooperative games and their threshold versions.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2009

Computing Shapley's saddles.

[BibT_eX]

[DOI]

SIGecom Exch., 2009

The Computational Complexity of Choice Sets.

[BibT_eX]

[DOI]

Math. Log. Q., 2009

Some Remarks on Dodgson's Voting Rule.

[BibT_eX]

[DOI]

Math. Log. Q., 2009

Symmetries and the complexity of pure Nash equilibrium.

[BibT_eX]

[DOI]

Markus Holzer

J. Comput. Syst. Sci., 2009

Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP

[BibT_eX]

[DOI]

CoRR, 2009

Ranking games.

[BibT_eX]

[DOI]

Artif. Intell., 2009

Computational aspects of Shapley's saddles.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008

On the Existence of Unconditionally Privacy-Preserving Auction Protocols.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst. Secur., 2008

Computing the minimal covering set.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2008

On Iterated Dominance, Matrix Elimination, and Matched Paths.

[BibT_eX]

[DOI]

Markus Holzer

Electron. Colloquium Comput. Complex., 2008

On the Hardness and Existence of Quasi-Strict Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007

Recognizing Members of the Tournament Equilibrium Set is NP-hard

[BibT_eX]

[DOI]

CoRR, 2007

PageRank as a Weak Tournament Solution.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Spiteful Bidding in Sealed-Bid Auctions.

[BibT_eX]

[DOI]

Yoav Shoham

Proceedings of the IJCAI 2007, 2007

A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

Commitment and extortion.

[BibT_eX]

[DOI]

Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

Computational Aspects of Covering in Dominance Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

How to obtain full privacy in auctions.

[BibT_eX]

[DOI]

Int. J. Inf. Sec., 2006

On Strictly Competitive Multi-Player Games.

[BibT_eX]

[DOI]

Yoav Shoham

Proceedings of the Proceedings, 2006

2005

Unconditional privacy in social choice.

[BibT_eX]

[DOI]

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

On Correctness and Privacy in Distributed Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Agent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms, 2005

Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology, 2005

Efficient Privacy-Preserving Protocols for Multi-unit Auctions.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2005

Decentralized voting with unconditional privacy.

[BibT_eX]

[DOI]

Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), 2005

2004

Im)Possibility of Unconditionally Privacy-Preserving Auctions.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

2003

Fundamental aspects of privacy and deception in electronic auctions.

[BibT_eX]

[DOI]

PhD thesis, 2003

Social choice and preference protection: towards fully private mechanism design.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Fully Private Auctions in a Constant Number of Rounds.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography, 2003

2001

Cryptographic Protocols for Secure Second-Price Auctions.

[BibT_eX]

[DOI]

Proceedings of the Cooperative Information Agents V, 5th International Workshop, 2001

Antisocial Agents and Vickrey Auctions.

[BibT_eX]

[DOI]

Gerhard Weiß

Proceedings of the Intelligent Agents VIII, 8th International Workshop, 2001

Vicious strategies for Vickrey auctions.

[BibT_eX]

[DOI]

Gerhard Weiß

Proceedings of the Fifth International Conference on Autonomous Agents, 2001

2000

Task Assignment in Multiagent Systems Based on Vickrey-Type Auctioning and Leveled Commitment Contracting.

[BibT_eX]

[DOI]

Wilfried Brauer

Gerhard Weiß

Proceedings of the Cooperative Information Agents IV, 2000

1999

Using Term Space Maps to Capture Search Control Knowledge in Equational Theorem Proving.

[BibT_eX]

[DOI]

Stephan Schulz