Using Term Space Maps to Capture Search Control Knowledge in Equational Theorem Proving. - Stephan Schulz 001; Felix Brandt 001 (FLAIRS, 1999)

Task Assignment in Multiagent Systems Based on Vickrey-Type Auctioning and Leveled Commitment Contracting. - Felix Brandt 001; Wilfried Brauer; Gerhard Weiß 001 (CIA, 2000)

Vicious strategies for Vickrey auctions. - Felix Brandt 001; Gerhard Weiß 001 (Agents, 2001)

Antisocial Agents and Vickrey Auctions. - Felix Brandt 001; Gerhard Weiß 001 (ATAL, 2001)

Cryptographic Protocols for Secure Second-Price Auctions. - Felix Brandt 001 (CIA, 2001)

Fully Private Auctions in a Constant Number of Rounds. - Felix Brandt 001 (Financial Cryptography, 2003)

Social choice and preference protection: towards fully private mechanism design. - Felix Brandt 001 (EC, 2003)

Fundamental aspects of privacy and deception in electronic auctions. - Felix Brandt 001 (2003)

Im)Possibility of Unconditionally Privacy-Preserving Auctions. - Felix Brandt 001; Tuomas Sandholm (AAMAS, 2004)

Decentralized voting with unconditional privacy. - Felix Brandt 001; Tuomas Sandholm (AAMAS, 2005)

Efficient Privacy-Preserving Protocols for Multi-unit Auctions. - Felix Brandt 001; Tuomas Sandholm (Financial Cryptography, 2005)

Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption. - Felix Brandt 001 (ICISC, 2005)

On Correctness and Privacy in Distributed Mechanisms. - Felix Brandt 001; Tuomas Sandholm (AMEC@AAMAS/TADA@IJCAI, 2005)

Unconditional privacy in social choice. - Felix Brandt 001; Tuomas Sandholm (TARK, 2005)

On Strictly Competitive Multi-Player Games. - Felix Brandt 001; Felix A. Fischer; Yoav Shoham (AAAI, 2006)

How to obtain full privacy in auctions. - Felix Brandt 001 (Int. J. Inf. Sec., 2006)

Computational Aspects of Covering in Dominance Graphs. - Felix Brandt 001; Felix A. Fischer (AAAI, 2007)

Commitment and extortion. - Paul Harrenstein; Felix Brandt 001; Felix A. Fischer (AAMAS, 2007)

A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios. - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein; Yoav Shoham (IJCAI, 2007)

Spiteful Bidding in Sealed-Bid Auctions. - Felix Brandt 001; Tuomas Sandholm; Yoav Shoham (IJCAI, 2007)

PageRank as a Weak Tournament Solution. - Felix Brandt 001; Felix A. Fischer (WINE, 2007)

Recognizing Members of the Tournament Equilibrium Set is NP-hard - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein (CoRR, 2007)

On the Hardness and Existence of Quasi-Strict Equilibria. - Felix Brandt 001; Felix A. Fischer (SAGT, 2008)

On Iterated Dominance, Matrix Elimination, and Matched Paths. - Felix Brandt 001; Felix A. Fischer; Markus Holzer 001 (Electron. Colloquium Comput. Complex., 2008)

Computing the minimal covering set. - Felix Brandt 001; Felix A. Fischer (Math. Soc. Sci., 2008)

On the Existence of Unconditionally Privacy-Preserving Auction Protocols. - Felix Brandt 001; Tuomas Sandholm (ACM Trans. Inf. Syst. Secur., 2008)

Computational aspects of Shapley's saddles. - Felix Brandt 001; Markus Brill; Felix A. Fischer; Paul Harrenstein (AAMAS (1), 2009)

Ranking games. - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein; Yoav Shoham (Artif. Intell., 2009)

Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP - Dorothea Baumeister; Felix Brandt 001; Felix A. Fischer; Jörg Rothe (CoRR, 2009)

Symmetries and the complexity of pure Nash equilibrium. - Felix Brandt 001; Felix A. Fischer; Markus Holzer 001 (J. Comput. Syst. Sci., 2009)

Some Remarks on Dodgson's Voting Rule. - Felix Brandt 001 (Math. Log. Q., 2009)

The Computational Complexity of Choice Sets. - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein (Math. Log. Q., 2009)

Computing Shapley's saddles. - Felix Brandt 001; Markus Brill; Felix A. Fischer; Paul Harrenstein; Jan Hoffmann 002 (SIGecom Exch., 2009)

Monotone cooperative games and their threshold versions. - Haris Aziz 001; Felix Brandt 001; Paul Harrenstein (AAMAS, 2010)

10101 Abstracts Collection - Computational Foundations of Social Choice. - Felix Brandt 001; Vincent Conitzer; Lane A. Hemaspaandra; Jean-François Laslier; William S. Zwicker (Computational Foundations of Social Choice, 2010)

10101 Executive Summary - Computational Foundations of Social Choice. - Felix Brandt 001; Vincent Conitzer; Lane A. Hemaspaandra; Jean-François Laslier; William S. Zwicker (Computational Foundations of Social Choice, 2010)

Tournament Solutions and Their Applications to Multiagent Decision Making. - Felix Brandt 001 (MATES, 2010)

A computational analysis of the tournament equilibrium set. - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein; Maximilian Mair (Soc. Choice Welf., 2010)

Auctions. - Felix Brandt 001 (Handbook of Financial Cryptography and Security, 2010)

From Arrow's Impossibility to Schwartz's Tournament Equilibrium Set - (Invited Tutorial). - Felix Brandt 001 (RAMiCS, 2011)

Stable partitions in additively separable hedonic games. - Haris Aziz 001; Felix Brandt 001; Hans Georg Seedig (AAMAS, 2011)

Optimal Partitions in Additively Separable Hedonic Games. - Haris Aziz 001; Felix Brandt 001; Hans Georg Seedig (IJCAI, 2011)

Group-Strategyproof Irresolute Social Choice Functions. - Felix Brandt 001 (IJCAI, 2011)

On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. - Felix Brandt 001; Markus Brill; Hans Georg Seedig (IJCAI, 2011)

Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions. - Felix Brandt 001; Markus Brill (TARK, 2011)

Minimal stable sets in tournaments. - Felix Brandt 001 (J. Econ. Theory, 2011)

Set-rationalizable choice and self-stability. - Felix Brandt 001; Paul Harrenstein (J. Econ. Theory, 2011)

The Computational Complexity of Weak Saddles. - Felix Brandt 001; Markus Brill; Felix A. Fischer; Jan Hoffmann 002 (Theory Comput. Syst., 2011)

On the Complexity of Iterated Weak Dominance in Constant-Sum Games. - Felix Brandt 001; Markus Brill; Felix A. Fischer; Paul Harrenstein (Theory Comput. Syst., 2011)

Equilibria of graphical games with symmetries. - Felix Brandt 001; Felix A. Fischer; Markus Holzer 001 (Theor. Comput. Sci., 2011)

Special Issue on Computational Foundations of Social Choice. - Felix Brandt 001; William S. Zwicker (Math. Soc. Sci., 2012)

On the tradeoff between economic efficiency and strategy proofness in randomized social choice. - Haris Aziz 001; Felix Brandt 001; Markus Brill (AAMAS, 2013)

It only takes a few: on the hardness of voting with a constant number of agents. - Felix Brandt 001; Paul Harrenstein; Keyvan Kardel; Hans Georg Seedig (AAMAS, 2013)

On Popular Random Assignments. - Haris Aziz 001; Felix Brandt 001; Paul Stursberg (SAGT, 2013)

The Computational Complexity of Random Serial Dictatorship. - Haris Aziz 001; Felix Brandt 001; Markus Brill (WINE, 2013)

Computing desirable partitions in additively separable hedonic games. - Haris Aziz 001; Felix Brandt 001; Hans Georg Seedig (Artif. Intell., 2013)

A tournament of order 24 with two disjoint TEQ-retentive sets - Felix Brandt 001; Hans Georg Seedig (CoRR, 2013)

Pareto optimality in coalition formation. - Haris Aziz 001; Felix Brandt 001; Paul Harrenstein (Games Econ. Behav., 2013)

The Complexity of Computing Minimal Unidirectional Covering Sets. - Dorothea Baumeister; Felix Brandt 001; Felix A. Fischer; Jan Hoffmann 002; Jörg Rothe (Theory Comput. Syst., 2013)

On the Rate of Convergence of Fictitious Play. - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein (Theory Comput. Syst., 2013)

A counterexample to a conjecture of Schwartz. - Felix Brandt 001; Maria Chudnovsky; Ilhee Kim; Gaku Liu; Sergey Norin; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé (Soc. Choice Welf., 2013)

On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice. - Haris Aziz 001; Florian Brandl; Felix Brandt 001 (AAAI, 2014)

Fractional hedonic games. - Haris Aziz 001; Felix Brandt 001; Paul Harrenstein (AAMAS, 2014)

On the Discriminative Power of Tournament Solutions. - Felix Brandt 001; Hans Georg Seedig (OR, 2014)

Universal pareto dominance and welfare for plausible utility functions. - Haris Aziz 001; Florian Brandl; Felix Brandt 001 (EC, 2014)

Minimal retentive sets in tournaments. - Felix Brandt 001; Markus Brill; Felix A. Fischer; Paul Harrenstein (Soc. Choice Welf., 2014)

Computational aspects of random serial dictatorship. - Haris Aziz 001; Felix Brandt 001; Markus Brill; Julián Mestre (SIGecom Exch., 2014)

Incentives for Participation and Abstention in Probabilistic Social Choice. - Florian Brandl; Felix Brandt 001; Johannes Hofbauer (AAMAS, 2015)

Fractional Hedonic Games: Individual and Group Stability. - Florian Brandl; Felix Brandt 001; Martin Strobel 001 (AAMAS, 2015)

Pnyx: : A Powerful and User-friendly Tool for Preference Aggregation. - Felix Brandt 001; Guillaume Chabin; Christian Geist (AAMAS, 2015)

Computational Social Choice (Tutorial). - Felix Brandt 001 (STACS, 2015)

Consistent Probabilistic Social Choice. - Florian Brandl; Felix Brandt 001; Hans Georg Seedig (CoRR, 2015)

The Impossibility of Extending Random Dictatorship to Weak Preferences. - Florian Brandl; Felix Brandt 001; Warut Suksompong (CoRR, 2015)

Bounds on the disparity and separation of tournament solutions. - Felix Brandt 001; Andre Dau; Hans Georg Seedig (Discret. Appl. Math., 2015)

Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. - Felix Brandt 001; Markus Brill; Edith Hemaspaandra; Lane A. Hemaspaandra (J. Artif. Intell. Res., 2015)

Set-monotonicity implies Kelly-strategyproofness. - Felix Brandt 001 (Soc. Choice Welf., 2015)

Analyzing the Practical Relevance of Voting Paradoxes via Ehrhart Theory, Computer Simulations, and Empirical Data. - Felix Brandt 001; Christian Geist; Martin Strobel 001 (AAMAS, 2016)

Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. - Florian Brandl; Felix Brandt 001; Christian Geist (IJCAI, 2016)

An ordinal minimax theorem. - Felix Brandt 001; Markus Brill; Warut Suksompong (Games Econ. Behav., 2016)

Finding Strategyproof Social Choice Functions via SAT Solving. - Felix Brandt 001; Christian Geist (J. Artif. Intell. Res., 2016)

A note on the McKelvey uncovered set and Pareto optimality. - Felix Brandt 001; Christian Geist; Paul Harrenstein (Soc. Choice Welf., 2016)

Tournament Solutions. - Felix Brandt 001; Markus Brill; Paul Harrenstein (Handbook of Computational Social Choice, 2016)

Introduction to Computational Social Choice. - Felix Brandt 001; Vincent Conitzer; Ulle Endriss; Jérôme Lang; Ariel D. Procaccia (Handbook of Computational Social Choice, 2016)

Algorithmic Economics und Operations Research. - Susanne Albers; Martin Bichler; Felix Brandt 001; Peter Gritzmann; Rainer Kolisch (50 Jahre Universitäts-Informatik in München, 2017)

Majority Graphs of Assignment Problems and Properties of Popular Random Assignments. - Felix Brandt 001; Johannes Hofbauer; Martin Suderland (AAMAS, 2017)

Random Assignment with Optional Participation. - Florian Brandl; Felix Brandt 001; Johannes Hofbauer (AAMAS, 2017)

k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters. - Georg Bachmeier; Felix Brandt 001; Christian Geist; Paul Harrenstein; Keyvan Kardel; Dominik Peters; Hans Georg Seedig (CoRR, 2017)

Arrovian Aggregation via Pairwise Utilitarianism. - Florian Brandl; Felix Brandt 001 (CoRR, 2017)

Algorithmic Economics und Operations Research. - Susanne Albers; Martin Bichler; Felix Brandt 001; Peter Gritzmann; Rainer Kolisch (Inform. Spektrum, 2017)

Minimal extending sets in tournaments. - Felix Brandt 001; Paul Harrenstein; Hans Georg Seedig (Math. Soc. Sci., 2017)

Optimal bounds for the no-show paradox via SAT solving. - Felix Brandt 001; Christian Geist; Dominik Peters (Math. Soc. Sci., 2017)

Computing Dominance-Based Solution Concepts. - Felix Brandt 001; Markus Brill (ACM Trans. Economics and Comput., 2017)

Voting with Ties: Strong Impossibilities via SAT Solving. - Felix Brandt 001; Christian Saile; Christian Stricker 001 (AAMAS, 2018)

The Incompatibility of Fishburn-Strategyproofness and Pareto-Efficiency. - Felix Brandt 001; Manuel Eberl; Christian Saile; Christian Stricker 001 (Arch. Formal Proofs, 2018)

On the tradeoff between efficiency and strategyproofness. - Haris Aziz 001; Florian Brandl; Felix Brandt 001; Markus Brill (Games Econ. Behav., 2018)

Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. - Florian Brandl; Felix Brandt 001; Manuel Eberl; Christian Geist (J. ACM, 2018)

Extending tournament solutions. - Felix Brandt 001; Markus Brill; Paul Harrenstein (Soc. Choice Welf., 2018)

Exploring the No-Show Paradox for Condorcet Extensions Using Ehrhart Theory and Computer Simulations. - Felix Brandt 001; Johannes Hofbauer; Martin Strobel 001 (AAMAS, 2019)

Welfare maximization entices participation. - Florian Brandl; Felix Brandt 001; Johannes Hofbauer (Games Econ. Behav., 2019)

Strategic Abstention based on Preference Extensions: Positive Results and Computer-Generated Impossibilities. - Florian Brandl; Felix Brandt 001; Christian Geist; Johannes Hofbauer (J. Artif. Intell. Res., 2019)

k-Majority digraphs and the hardness of voting with a constant number of voters. - Georg Bachmeier; Felix Brandt 001; Christian Geist; Paul Harrenstein; Keyvan Kardel; Dominik Peters; Hans Georg Seedig (J. Comput. Syst. Sci., 2019)

Fractional Hedonic Games. - Haris Aziz 001; Florian Brandl; Felix Brandt 001; Paul Harrenstein; Martin Olsen; Dominik Peters (ACM Trans. Economics and Comput., 2019)

Computational Social Choice: The First Ten Years and Beyond. - Haris Aziz 001; Felix Brandt 001; Edith Elkind; Piotr Skowron 001 (Computing and Software Science, 2019)

On the Structure of Stable Tournament Solutions. - Felix Brandt 001; Markus Brill; Hans Georg Seedig; Warut Suksompong (CoRR, 2020)

Funding Public Projects: A Case for the Nash Product Rule. - Florian Brandl; Felix Brandt 001; Dominik Peters; Christian Stricker 001; Warut Suksompong (CoRR, 2020)

Reaching Individually Stable Coalition Structures in Hedonic Games. - Felix Brandt 001; Martin Bullinger; Anaëlle Wilczynski (AAAI, 2021)

Distribution Rules Under Dichotomous Preferences: Two Out of Three Ain't Bad. - Florian Brandl; Felix Brandt 001; Dominik Peters; Christian Stricker 001 (EC, 2021)

Funding Public Projects: A Case for the Nash Product Rule. - Florian Brandl; Felix Brandt 001; Matthias Greger; Dominik Peters; Christian Stricker 001; Warut Suksompong (WINE, 2021)

Characterizing the Top Cycle via Strategyproofness. - Felix Brandt 001; Patrick Lederer (CoRR, 2021)

Single-Agent Dynamics in Additively Separable Hedonic Games. - Felix Brandt 001; Martin Bullinger; Leo Tappe (AAAI, 2022)

Finding and Recognizing Popular Coalition Structures. - Felix Brandt 001; Martin Bullinger (J. Artif. Intell. Res., 2022)

On the Indecisiveness of Kelly-Strategyproof Social Choice Functions. - Felix Brandt 001; Martin Bullinger; Patrick Lederer (J. Artif. Intell. Res., 2022)

Strategyproof social choice when preferences and outcomes may contain ties. - Felix Brandt 001; Christian Saile; Christian Stricker 001 (J. Econ. Theory, 2022)

An analytical and experimental comparison of maximal lottery schemes. - Florian Brandl; Felix Brandt 001; Christian Stricker 001 (Soc. Choice Welf., 2022)

Strategyproof Social Decision Schemes on Super Condorcet Domains. - Felix Brandt 001; Patrick Lederer; Sascha Tausch (AAMAS, 2023)

Balanced Donor Coordination. - Felix Brandt 001; Matthias Greger; Erel Segal-Halevi; Warut Suksompong (EC, 2023)

A Robust Characterization of Nash Equilibrium. - Florian Brandl; Felix Brandt 001 (CoRR, 2023)

Reaching Individually Stable Coalition Structures. - Felix Brandt 001; Martin Bullinger; Anaëlle Wilczynski (ACM Trans. Economics and Comput., 2023)

Incentives in social decision schemes with pairwise comparison preferences. - Felix Brandt 001; Patrick Lederer; Warut Suksompong (Games Econ. Behav., 2023)

Optimal Budget Aggregation with Single-Peaked Preferences. - Felix Brandt 001; Matthias Greger; Erel Segal-Halevi; Warut Suksompong (EC, 2024)

Stability based on single-agent deviations in additively separable hedonic games. - Felix Brandt 001; Martin Bullinger; Leo Tappe (Artif. Intell., 2024)

On the Convergence of Swap Dynamics to Pareto-Optimal Matchings. - Felix Brandt 001; Anaëlle Wilczynski (J. Artif. Intell. Res., 2024)

Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes. - Felix Brandt 001; Patrick Lederer; René Romen (Soc. Choice Welf., 2024)

Weak Strategyproofness in Randomized Social Choice. - Felix Brandt 001; Patrick Lederer (AAAI, 2025)

Condorcet-consistent choice among three candidates. - Felix Brandt 001; Chris Dong; Dominik Peters (Games Econ. Behav., 2025)

Special Issue on Fair Public Decision Making: Allocating Budgets, Seats, and Probability. - Haris Aziz 001; Felix Brandt 001; Edith Elkind; Jérôme Lang (Soc. Choice Welf., 2025)