Felix Brandt

According to our database1, Felix Brandt authored at least 93 papers between 1999 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving.
J. ACM, 2018

On the tradeoff between efficiency and strategyproofness.
Games and Economic Behavior, 2018

The Incompatibility of Fishburn-Strategyproofness and Pareto-Efficiency.
Archive of Formal Proofs, 2018

An Analytical and Experimental Comparison of Maximal Lottery Schemes.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Voting with Ties: Strong Impossibilities via SAT Solving.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Algorithmic Economics und Operations Research.
Informatik Spektrum, 2017

Random Assignment with Optional Participation.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Majority Graphs of Assignment Problems and Properties of Popular Random Assignments.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
Introduction to Computational Social Choice.
Proceedings of the Handbook of Computational Social Choice, 2016

Tournament Solutions.
Proceedings of the Handbook of Computational Social Choice, 2016

A note on the McKelvey uncovered set and Pareto optimality.
Social Choice and Welfare, 2016

An ordinal minimax theorem.
Games and Economic Behavior, 2016

Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving.
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.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Optimal Bounds for the No-Show Paradox via SAT Solving.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Set-monotonicity implies Kelly-strategyproofness.
Social Choice and Welfare, 2015

Bounds on the disparity and separation of tournament solutions.
Discrete Applied Mathematics, 2015

Computational Social Choice (Tutorial).
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Pnyx: : A Powerful and User-friendly Tool for Preference Aggregation.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Fractional Hedonic Games: Individual and Group Stability.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Incentives for Participation and Abstention in Probabilistic Social Choice.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Computational aspects of random serial dictatorship.
SIGecom Exchanges, 2014

Universal pareto dominance and welfare for plausible utility functions.
Proceedings of the ACM Conference on Economics and Computation, 2014

On the Discriminative Power of Tournament Solutions.
Proceedings of the Operations Research Proceedings 2014, 2014

Extending Tournament Solutions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Minimal extending sets in tournaments.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Finding strategyproof social choice functions via SAT solving.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Fractional hedonic games.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Extending Tournament Solutions.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
A counterexample to a conjecture of Schwartz.
Social Choice and Welfare, 2013

Computing desirable partitions in additively separable hedonic games.
Artif. Intell., 2013

The Computational Complexity of Random Serial Dictatorship.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

On Popular Random Assignments.
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.
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.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
Special Issue on Computational Foundations of Social Choice.
Mathematical Social Sciences, 2012

Computing dominance-based solution concepts.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011
Set-rationalizable choice and self-stability.
J. Economic Theory, 2011

Minimal stable sets in tournaments.
J. Economic Theory, 2011

Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Pareto Optimality in Coalition Formation.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions.
Proceedings of the IJCAI 2011, 2011

Group-Strategyproof Irresolute Social Choice Functions.
Proceedings of the IJCAI 2011, 2011

Optimal Partitions in Additively Separable Hedonic Games.
Proceedings of the IJCAI 2011, 2011

Stable partitions in additively separable hedonic games.
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).
Proceedings of the Relational and Algebraic Methods in Computer Science, 2011

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

On Iterated Dominance, Matrix Elimination, and Matched Paths.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

On the Rate of Convergence of Fictitious Play.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Tournament Solutions and Their Applications to Multiagent Decision Making.
Proceedings of the Multiagent System Technologies, 8th German Conference, 2010

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

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

The Complexity of Computing Minimal Unidirectional Covering Sets.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

Minimal retentive sets in tournaments.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Monotone cooperative games and their threshold versions.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Computing Shapley's saddles.
SIGecom Exchanges, 2009

Some Remarks on Dodgson's Voting Rule.
Math. Log. Q., 2009

Ranking games.
Artif. Intell., 2009

On the Complexity of Iterated Weak Dominance in Constant-Sum Games.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

The Computational Complexity of Weak Saddles.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Computational aspects of Shapley's saddles.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
On the Existence of Unconditionally Privacy-Preserving Auction Protocols.
ACM Trans. Inf. Syst. Secur., 2008

Computing the minimal covering set.
Mathematical Social Sciences, 2008

Equilibria of Graphical Games with Symmetries.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

On the Hardness and Existence of Quasi-Strict Equilibria.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

A Computational Analysis of the Tournament Equilibrium Set.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
PageRank as a Weak Tournament Solution.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

The computational complexity of choice sets.
Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), 2007

Symmetries and the Complexity of Pure Nash Equilibrium.
Proceedings of the STACS 2007, 2007

Spiteful Bidding in Sealed-Bid Auctions.
Proceedings of the IJCAI 2007, 2007

A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios.
Proceedings of the IJCAI 2007, 2007

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

Computational Aspects of Covering in Dominance Graphs.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
How to obtain full privacy in auctions.
Int. J. Inf. Sec., 2006

On Strictly Competitive Multi-Player Games.
Proceedings of the Proceedings, 2006

2005
Unconditional privacy in social choice.
Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2005), 2005

On Correctness and Privacy in Distributed Mechanisms.
Proceedings of the Agent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms, 2005

Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption.
Proceedings of the Information Security and Cryptology, 2005

Efficient Privacy-Preserving Protocols for Multi-unit Auctions.
Proceedings of the Financial Cryptography and Data Security, 2005

Spiteful Bidding in Sealed-Bid Auctions.
Proceedings of the Computing and Markets, 3.-7. January 2005, 2005

Decentralized voting with unconditional privacy.
Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), 2005

2004
Im)Possibility of Unconditionally Privacy-Preserving Auctions.
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.
PhD thesis, 2003

Social choice and preference protection: towards fully private mechanism design.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Fully Private Auctions in a Constant Number of Rounds.
Proceedings of the Financial Cryptography, 2003

2001
Cryptographic Protocols for Secure Second-Price Auctions.
Proceedings of the Cooperative Information Agents V, 5th International Workshop, 2001

Antisocial Agents and Vickrey Auctions.
Proceedings of the Intelligent Agents VIII, 8th International Workshop, 2001

Vicious strategies for Vickrey auctions.
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.
Proceedings of the Cooperative Information Agents IV, 2000

1999
Using Term Space Maps to Capture Search Control Knowledge in Equational Theorem Proving.
Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference, 1999


  Loading...