Name Venue Year citations
Relaxed Notions of Condorcet-Consistency and Efficiency for Strategyproof Social Decision Schemes. AAMAS 2022 0
On the Indecisiveness of Kelly-Strategyproof Social Choice Functions. JAIR 2022 0
Reaching Individually Stable Coalition Structures in Hedonic Games. AAAI 2021 5
On the Indecisiveness of Kelly-Strategyproof Social Choice Functions. AAMAS 2021 2
Funding Public Projects: A Case for the Nash Product Rule. WINE 2021 9
Finding and Recognizing Popular Coalition Structures. AAMAS 2020 6
On the Convergence of Swap Dynamics to Pareto-Optimal Matchings. WINE 2019 5
Exploring the No-Show Paradox for Condorcet Extensions Using Ehrhart Theory and Computer Simulations. AAMAS 2019 10
Strategic Abstention based on Preference Extensions: Positive Results and Computer-Generated Impossibilities. JAIR 2019 0
Voting with Ties: Strong Impossibilities via SAT Solving. AAMAS 2018 16
An Analytical and Experimental Comparison of Maximal Lottery Schemes. IJCAI 2018 6
Majority Graphs of Assignment Problems and Properties of Popular Random Assignments. AAMAS 2017 14
Random Assignment with Optional Participation. AAMAS 2017 10
Analyzing the Practical Relevance of Voting Paradoxes via Ehrhart Theory, Computer Simulations, and Empirical Data. AAMAS 2016 17
Finding Strategyproof Social Choice Functions via SAT Solving. JAIR 2016 0
Optimal Bounds for the No-Show Paradox via SAT Solving. AAMAS 2016 47
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. IJCAI 2016 38
Pnyx: : A Powerful and User-friendly Tool for Preference Aggregation. AAMAS 2015 14
Incentives for Participation and Abstention in Probabilistic Social Choice. AAMAS 2015 38
Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities. IJCAI 2015 33
Fractional Hedonic Games: Individual and Group Stability. AAMAS 2015 37
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. JAIR 2015 0
Fractional hedonic games. AAMAS 2014 101
On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice. AAAI 2014 37
Finding strategyproof social choice functions via SAT solving. AAMAS 2014 53
Extending Tournament Solutions. AAAI 2014 19
Minimal extending sets in tournaments. AAMAS 2014 0
The Computational Complexity of Random Serial Dictatorship. WINE 2013 29
It only takes a few: on the hardness of voting with a constant number of agents. AAMAS 2013 13
On the tradeoff between economic efficiency and strategy proofness in randomized social choice. AAMAS 2013 62
Computing desirable partitions in additively separable hedonic games. Artificial Intelligence 2013 0
Group-Strategyproof Irresolute Social Choice Functions. IJCAI 2011 20
Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions. TARK 2011 41
Optimal Partitions in Additively Separable Hedonic Games. IJCAI 2011 12
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. IJCAI 2011 27
Stable partitions in additively separable hedonic games. AAMAS 2011 55
Minimal retentive sets in tournaments. AAMAS 2010 14
Monotone cooperative games and their threshold versions. AAMAS 2010 31
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI 2010 122
Ranking games. Artificial Intelligence 2009 59
Computational aspects of Shapley's saddles. AAMAS 2009 12
A Computational Analysis of the Tournament Equilibrium Set. AAAI 2008 50
Equilibria of Graphical Games with Symmetries. WINE 2008 2
Spiteful Bidding in Sealed-Bid Auctions. IJCAI 2007 86
Computational Aspects of Covering in Dominance Graphs. AAAI 2007 8
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios. IJCAI 2007 9
Commitment and extortion. AAMAS 2007 10
The computational complexity of choice sets. TARK 2007 46
PageRank as a Weak Tournament Solution. WINE 2007 17
On Strictly Competitive Multi-Player Games. AAAI 2006 15
Unconditional privacy in social choice. TARK 2005 14
Decentralized voting with unconditional privacy. AAMAS 2005 11
Im)Possibility of Unconditionally Privacy-Preserving Auctions. AAMAS 2004 0
Copyright ©2019 Universit├Ąt W├╝rzburg

Impressum | Privacy | FAQ