Felix Brandt 0001
59 publications
7 venues
H Index 22
Affiliation
Technical University Munich, GermanyLinks
| Name | Venue | Year | citations |
|---|---|---|---|
On the Convergence of Swap Dynamics to Pareto-Optimal Matchings.
|
JAIR | 2024 | 0 |
| Stability based on single-agent deviations in additively separable hedonic games.
|
Artificial Intelligence | 2024 | 0 |
| Strategyproof Social Decision Schemes on Super Condorcet Domains.
|
AAMAS | 2023 | 0 |
| Single-Agent Dynamics in Additively Separable Hedonic Games.
|
AAAI | 2022 | 4 |
| Relaxed Notions of Condorcet-Consistency and Efficiency for Strategyproof Social Decision Schemes.
|
AAMAS | 2022 | 1 |
| Incentives in Social Decision Schemes with Pairwise Comparison Preferences.
|
IJCAI | 2022 | 0 |
| Finding and Recognizing Popular Coalition Structures.
|
JAIR | 2022 | 0 |
| On the Indecisiveness of Kelly-Strategyproof Social Choice Functions.
|
JAIR | 2022 | 0 |
| On the Indecisiveness of Kelly-Strategyproof Social Choice Functions.
|
AAMAS | 2021 | 5 |
| Reaching Individually Stable Coalition Structures in Hedonic Games.
|
AAAI | 2021 | 10 |
| Funding Public Projects: A Case for the Nash Product Rule.
|
WINE | 2021 | 0 |
| Finding and Recognizing Popular Coalition Structures.
|
AAMAS | 2020 | 12 |
| Exploring the No-Show Paradox for Condorcet Extensions Using Ehrhart Theory and Computer Simulations.
|
AAMAS | 2019 | 15 |
| On the Convergence of Swap Dynamics to Pareto-Optimal Matchings.
|
WINE | 2019 | 6 |
| Strategic Abstention based on Preference Extensions: Positive Results and Computer-Generated Impossibilities.
|
JAIR | 2019 | 0 |
| An Analytical and Experimental Comparison of Maximal Lottery Schemes.
|
IJCAI | 2018 | 9 |
| Voting with Ties: Strong Impossibilities via SAT Solving.
|
AAMAS | 2018 | 18 |
| Random Assignment with Optional Participation.
|
AAMAS | 2017 | 10 |
| Majority Graphs of Assignment Problems and Properties of Popular Random Assignments.
|
AAMAS | 2017 | 14 |
| Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving.
|
IJCAI | 2016 | 43 |
| Analyzing the Practical Relevance of Voting Paradoxes via Ehrhart Theory, Computer Simulations, and Empirical Data.
|
AAMAS | 2016 | 24 |
| Finding Strategyproof Social Choice Functions via SAT Solving.
|
JAIR | 2016 | 0 |
| Optimal Bounds for the No-Show Paradox via SAT Solving.
|
AAMAS | 2016 | 55 |
| Pnyx: : A Powerful and User-friendly Tool for Preference Aggregation.
|
AAMAS | 2015 | 15 |
| Incentives for Participation and Abstention in Probabilistic Social Choice.
|
AAMAS | 2015 | 39 |
| Fractional Hedonic Games: Individual and Group Stability.
|
AAMAS | 2015 | 41 |
| Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities.
|
IJCAI | 2015 | 33 |
| Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.
|
JAIR | 2015 | 0 |
| Finding strategyproof social choice functions via SAT solving.
|
AAMAS | 2014 | 58 |
| Fractional hedonic games.
|
AAMAS | 2014 | 113 |
| Minimal extending sets in tournaments.
|
AAMAS | 2014 | 12 |
| On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice.
|
AAAI | 2014 | 41 |
| Extending Tournament Solutions.
|
AAAI | 2014 | 22 |
| The Computational Complexity of Random Serial Dictatorship.
|
WINE | 2013 | 79 |
| It only takes a few: on the hardness of voting with a constant number of agents.
|
AAMAS | 2013 | 12 |
| On the tradeoff between economic efficiency and strategy proofness in randomized social choice.
|
AAMAS | 2013 | 65 |
| Computing desirable partitions in additively separable hedonic games.
|
Artificial Intelligence | 2013 | 0 |
| Stable partitions in additively separable hedonic games.
|
AAMAS | 2011 | 60 |
| Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions.
|
TARK | 2011 | 44 |
| On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions.
|
IJCAI | 2011 | 28 |
| Optimal Partitions in Additively Separable Hedonic Games.
|
IJCAI | 2011 | 16 |
| Group-Strategyproof Irresolute Social Choice Functions.
|
IJCAI | 2011 | 0 |
| Minimal retentive sets in tournaments.
|
AAMAS | 2010 | 22 |
| Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.
|
AAAI | 2010 | 127 |
| Monotone cooperative games and their threshold versions.
|
AAMAS | 2010 | 32 |
| Ranking games.
|
Artificial Intelligence | 2009 | 58 |
| Computational aspects of Shapley's saddles.
|
AAMAS | 2009 | 11 |
| Equilibria of Graphical Games with Symmetries.
|
WINE | 2008 | 12 |
| A Computational Analysis of the Tournament Equilibrium Set.
|
AAAI | 2008 | 51 |
| The computational complexity of choice sets.
|
TARK | 2007 | 67 |
| Spiteful Bidding in Sealed-Bid Auctions.
|
IJCAI | 2007 | 90 |
| PageRank as a Weak Tournament Solution.
|
WINE | 2007 | 22 |
| Commitment and extortion.
|
AAMAS | 2007 | 12 |
| Computational Aspects of Covering in Dominance Graphs.
|
AAAI | 2007 | 8 |
| A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios.
|
IJCAI | 2007 | 9 |
| On Strictly Competitive Multi-Player Games.
|
AAAI | 2006 | 15 |
| Decentralized voting with unconditional privacy.
|
AAMAS | 2005 | 12 |
| Unconditional privacy in social choice.
|
TARK | 2005 | 14 |
| Im)Possibility of Unconditionally Privacy-Preserving Auctions.
|
AAMAS | 2004 | 0 |