Felix Brandt 0001

47 publications

7 venues

H Index15

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