Felix Brandt

177 papers A* 24A 27B 9C 2Misc 3Journal 86Unranked 18
YearRankTypeTitle / Venue / Authors
2026 J jnl
Majoritarian Assignment Rules.
CoRR
Felix Brandt, Haoyuan Chen, Chris Dong, Patrick Lederer, Alexander Schlenga
2026 J jnl
The Banks set and the bipartisan set may be disjoint.
Soc. Choice Welf.
Felix Brandt, Florian Grundbacher
2025 J jnl
Condorcet-consistent choice among three candidates.
Games Econ. Behav.
Felix Brandt, Chris Dong, Dominik Peters
2025 J jnl
Coordinating charitable donations with Leontief preferences.
J. Econ. Theory
Felix Brandt, Matthias Greger, Erel Segal-Halevi, Warut Suksompong
2025 J jnl
Special Issue on Fair Public Decision Making: Allocating Budgets, Seats, and Probability.
Soc. Choice Welf.
Haris Aziz, Felix Brandt, Edith Elkind, Jérôme Lang
2025 A* conf
Weak Strategyproofness in Randomized Social Choice.
AAAI
Felix Brandt, Patrick Lederer
2024 J jnl
Condorcet-Consistent Choice Among Three Candidates.
CoRR
Felix Brandt, Chris Dong, Dominik Peters
2024 J jnl
On the Convergence of Swap Dynamics to Pareto-Optimal Matchings.
J. Artif. Intell. Res.
Felix Brandt, Anaëlle Wilczynski
2024 A* conf
Optimal Budget Aggregation with Single-Peaked Preferences.
EC
Felix Brandt, Matthias Greger, Erel Segal-Halevi, Warut Suksompong
2024 J jnl
Optimal Budget Aggregation with Single-Peaked Preferences.
CoRR
Felix Brandt, Matthias Greger, Erel Segal-Halevi, Warut Suksompong
2024 J jnl
Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes.
Soc. Choice Welf.
Felix Brandt, Patrick Lederer, René Romen
2024 J jnl
Stability based on single-agent deviations in additively separable hedonic games.
Artif. Intell.
Felix Brandt, Martin Bullinger, Leo Tappe
2024 J jnl
Weak Strategyproofness in Randomized Social Choice.
CoRR
Felix Brandt, Patrick Lederer
2023 J jnl
A Robust Characterization of Nash Equilibrium.
CoRR
Florian Brandl, Felix Brandt
2023 A* conf
Balanced Donor Coordination.
EC
Felix Brandt, Matthias Greger, Erel Segal-Halevi, Warut Suksompong
2023 J jnl
Balanced Donor Coordination.
CoRR
Felix Brandt, Matthias Greger, Erel Segal-Halevi, Warut Suksompong
2023 J jnl
Incentives in social decision schemes with pairwise comparison preferences.
Games Econ. Behav.
Felix Brandt, Patrick Lederer, Warut Suksompong
2023 J jnl
Reaching Individually Stable Coalition Structures.
ACM Trans. Economics and Comput.
Felix Brandt, Martin Bullinger, Anaëlle Wilczynski
2023 A conf
Strategyproof Social Decision Schemes on Super Condorcet Domains.
AAMAS
Felix Brandt, Patrick Lederer, Sascha Tausch
2023 J jnl
Strategyproof Social Decision Schemes on Super Condorcet Domains.
CoRR
Felix Brandt, Patrick Lederer, Sascha Tausch
2022 J jnl
An analytical and experimental comparison of maximal lottery schemes.
Soc. Choice Welf.
Florian Brandl, Felix Brandt, Christian Stricker
2022 J jnl
Finding and Recognizing Popular Coalition Structures.
J. Artif. Intell. Res.
Felix Brandt, Martin Bullinger
2022 A* conf
Incentives in Social Decision Schemes with Pairwise Comparison Preferences.
IJCAI
Felix Brandt, Patrick Lederer, Warut Suksompong
2022 J jnl
Incentives in Social Decision Schemes with Pairwise Comparison Preferences.
CoRR
Felix Brandt, Patrick Lederer, Warut Suksompong
2022 J jnl
On the Indecisiveness of Kelly-Strategyproof Social Choice Functions.
J. Artif. Intell. Res.
Felix Brandt, Martin Bullinger, Patrick Lederer
2022 J jnl
Reaching Individually Stable Coalition Structures.
CoRR
Felix Brandt, Martin Bullinger, Anaëlle Wilczynski
2022 A conf
Relaxed Notions of Condorcet-Consistency and Efficiency for Strategyproof Social Decision Schemes.
AAMAS
Felix Brandt, Patrick Lederer, René Romen
2022 A* conf
Single-Agent Dynamics in Additively Separable Hedonic Games.
AAAI
Felix Brandt, Martin Bullinger, Leo Tappe
2022 J jnl
Strategyproof social choice when preferences and outcomes may contain ties.
J. Econ. Theory
Felix Brandt, Christian Saile, Christian Stricker
2021 J jnl
Characterizing the Top Cycle via Strategyproofness.
CoRR
Felix Brandt, Patrick Lederer
2021 A* conf
Distribution Rules Under Dichotomous Preferences: Two Out of Three Ain't Bad.
EC
Florian Brandl, Felix Brandt, Dominik Peters, Christian Stricker
2021 — conf
Funding Public Projects: A Case for the Nash Product Rule.
WINE
Florian Brandl, Felix Brandt, Matthias Greger, Dominik Peters, Christian Stricker, Warut Suksompong
2021 A conf
On the Indecisiveness of Kelly-Strategyproof Social Choice Functions.
AAMAS
Felix Brandt, Martin Bullinger, Patrick Lederer
2021 J jnl
On the Indecisiveness of Kelly-Strategyproof Social Choice Functions.
CoRR
Felix Brandt, Martin Bullinger, Patrick Lederer
2021 A* conf
Reaching Individually Stable Coalition Structures in Hedonic Games.
AAAI
Felix Brandt, Martin Bullinger, Anaëlle Wilczynski
2020 A conf
Finding and Recognizing Popular Coalition Structures.
AAMAS
Felix Brandt, Martin Bullinger
2020 J jnl
Funding Public Projects: A Case for the Nash Product Rule.
CoRR
Florian Brandl, Felix Brandt, Dominik Peters, Christian Stricker, Warut Suksompong
2020 J jnl
On the Structure of Stable Tournament Solutions.
CoRR
Felix Brandt, Markus Brill, Hans Georg Seedig, Warut Suksompong
2019 — ch.
Computational Social Choice: The First Ten Years and Beyond.
Computing and Software Science
Haris Aziz, Felix Brandt, Edith Elkind, Piotr Skowron
2019 A conf
Exploring the No-Show Paradox for Condorcet Extensions Using Ehrhart Theory and Computer Simulations.
AAMAS
Felix Brandt, Johannes Hofbauer, Martin Strobel
2019 J jnl
Fractional Hedonic Games.
ACM Trans. Economics and Comput.
Haris Aziz, Florian Brandl, Felix Brandt, Paul Harrenstein, Martin Olsen, Dominik Peters
2019 — conf
On the Convergence of Swap Dynamics to Pareto-Optimal Matchings.
WINE
Felix Brandt, Anaëlle Wilczynski
2019 J jnl
Strategic Abstention based on Preference Extensions: Positive Results and Computer-Generated Impossibilities.
J. Artif. Intell. Res.
Florian Brandl, Felix Brandt, Christian Geist, Johannes Hofbauer
2019 J jnl
Welfare maximization entices participation.
Games Econ. Behav.
Florian Brandl, Felix Brandt, Johannes Hofbauer
2018 A* conf
An Analytical and Experimental Comparison of Maximal Lottery Schemes.
IJCAI
Florian Brandl, Felix Brandt, Christian Stricker
2018 J jnl
Extending tournament solutions.
Soc. Choice Welf.
Felix Brandt, Markus Brill, Paul Harrenstein
2018 J jnl
On the tradeoff between efficiency and strategyproofness.
Games Econ. Behav.
Haris Aziz, Florian Brandl, Felix Brandt, Markus Brill
2018 J jnl
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving.
J. ACM
Florian Brandl, Felix Brandt, Manuel Eberl, Christian Geist
2018 J jnl
The Incompatibility of Fishburn-Strategyproofness and Pareto-Efficiency.
Arch. Formal Proofs
Felix Brandt, Manuel Eberl, Christian Saile, Christian Stricker
2018 A conf
Voting with Ties: Strong Impossibilities via SAT Solving.
AAMAS
Felix Brandt, Christian Saile, Christian Stricker
2017 — ch.
Algorithmic Economics und Operations Research.
50 Jahre Universitäts-Informatik in München
Susanne Albers, Martin Bichler, Felix Brandt, Peter Gritzmann, Rainer Kolisch
2017 J jnl
Algorithmic Economics und Operations Research.
Inform. Spektrum
Susanne Albers, Martin Bichler, Felix Brandt, Peter Gritzmann, Rainer Kolisch
2017 J jnl
Arrovian Aggregation via Pairwise Utilitarianism.
CoRR
Florian Brandl, Felix Brandt
2017 J jnl
Computing Dominance-Based Solution Concepts.
ACM Trans. Economics and Comput.
Felix Brandt, Markus Brill
2017 J jnl
Fractional Hedonic Games.
CoRR
Haris Aziz, Florian Brandl, Felix Brandt, Paul Harrenstein, Martin Olsen, Dominik Peters
2017 A conf
Majority Graphs of Assignment Problems and Properties of Popular Random Assignments.
AAMAS
Felix Brandt, Johannes Hofbauer, Martin Suderland
2017 J jnl
Minimal extending sets in tournaments.
Math. Soc. Sci.
Felix Brandt, Paul Harrenstein, Hans Georg Seedig
2017 J jnl
Optimal bounds for the no-show paradox via SAT solving.
Math. Soc. Sci.
Felix Brandt, Christian Geist, Dominik Peters
2017 A conf
Random Assignment with Optional Participation.
AAMAS
Florian Brandl, Felix Brandt, Johannes Hofbauer
2017 J jnl
k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters.
CoRR
Georg Bachmeier, Felix Brandt, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters, Hans Georg Seedig
2016 J jnl
A note on the McKelvey uncovered set and Pareto optimality.
Soc. Choice Welf.
Felix Brandt, Christian Geist, Paul Harrenstein
2016 J jnl
An ordinal minimax theorem.
Games Econ. Behav.
Felix Brandt, Markus Brill, Warut Suksompong
2016 A conf
Analyzing the Practical Relevance of Voting Paradoxes via Ehrhart Theory, Computer Simulations, and Empirical Data.
AAMAS
Felix Brandt, Christian Geist, Martin Strobel
2016 J jnl
Finding Strategyproof Social Choice Functions via SAT Solving.
J. Artif. Intell. Res.
Felix Brandt, Christian Geist
2016 — book
Handbook of Computational Social Choice
Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia
2016 — ch.
Introduction to Computational Social Choice.
Handbook of Computational Social Choice
Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia
2016 A conf
Optimal Bounds for the No-Show Paradox via SAT Solving.
AAMAS
Felix Brandt, Christian Geist, Dominik Peters
2016 J jnl
Optimal Bounds for the No-Show Paradox via SAT Solving.
CoRR
Felix Brandt, Christian Geist, Dominik Peters
2016 A* conf
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving.
IJCAI
Florian Brandl, Felix Brandt, Christian Geist
2016 J jnl
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving.
CoRR
Florian Brandl, Felix Brandt, Christian Geist
2016 — ch.
Tournament Solutions.
Handbook of Computational Social Choice
Felix Brandt, Markus Brill, Paul Harrenstein
2015 J jnl
Bounds on the disparity and separation of tournament solutions.
Discret. Appl. Math.
Felix Brandt, Andre Dau, Hans Georg Seedig
2015 J jnl
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.
J. Artif. Intell. Res.
Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra
2015 A conf
Computational Social Choice (Tutorial).
STACS
Felix Brandt
2015 J jnl
Consistent Probabilistic Social Choice.
CoRR
Florian Brandl, Felix Brandt, Hans Georg Seedig
2015 A conf
Fractional Hedonic Games: Individual and Group Stability.
AAMAS
Florian Brandl, Felix Brandt, Martin Strobel
2015 A conf
Incentives for Participation and Abstention in Probabilistic Social Choice.
AAMAS
Florian Brandl, Felix Brandt, Johannes Hofbauer
2015 A conf
Pnyx: : A Powerful and User-friendly Tool for Preference Aggregation.
AAMAS
Felix Brandt, Guillaume Chabin, Christian Geist
2015 J jnl
Set-monotonicity implies Kelly-strategyproofness.
Soc. Choice Welf.
Felix Brandt
2015 A* conf
Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities.
IJCAI
Florian Brandl, Felix Brandt, Christian Geist, Johannes Hofbauer
2015 J jnl
The Impossibility of Extending Random Dictatorship to Weak Preferences.
CoRR
Florian Brandl, Felix Brandt, Warut Suksompong
2015 J jnl
Welfare Maximization Entices Participation.
CoRR
Florian Brandl, Felix Brandt, Johannes Hofbauer
2014 J jnl
An Ordinal Minimax Theorem.
CoRR
Felix Brandt, Markus Brill, Warut Suksompong
2014 J jnl
Computational aspects of random serial dictatorship.
SIGecom Exch.
Haris Aziz, Felix Brandt, Markus Brill, Julián Mestre
2014 A* conf
Extending Tournament Solutions.
AAAI
Felix Brandt, Markus Brill, Paul Harrenstein
2014 Misc conf
Extending Tournament Solutions.
ISAIM
Felix Brandt, Markus Brill, Paul Harrenstein
2014 A conf
Finding strategyproof social choice functions via SAT solving.
AAMAS
Felix Brandt, Christian Geist
2014 A conf
Fractional hedonic games.
AAMAS
Haris Aziz, Felix Brandt, Paul Harrenstein
2014 A conf
Minimal extending sets in tournaments.
AAMAS
Felix Brandt, Paul Harrenstein, Hans Georg Seedig
2014 J jnl
Minimal retentive sets in tournaments.
Soc. Choice Welf.
Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein
2014 — conf
On the Discriminative Power of Tournament Solutions.
OR
Felix Brandt, Hans Georg Seedig
2014 A* conf
On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice.
AAAI
Haris Aziz, Florian Brandl, Felix Brandt
2014 A* conf
Universal pareto dominance and welfare for plausible utility functions.
EC
Haris Aziz, Florian Brandl, Felix Brandt
2013 J jnl
A counterexample to a conjecture of Schwartz.
Soc. Choice Welf.
Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé
2013 J jnl
A tournament of order 24 with two disjoint TEQ-retentive sets
CoRR
Felix Brandt, Hans Georg Seedig
2013 J jnl
Computing desirable partitions in additively separable hedonic games.
Artif. Intell.
Haris Aziz, Felix Brandt, Hans Georg Seedig
2013 A conf
It only takes a few: on the hardness of voting with a constant number of agents.
AAMAS
Felix Brandt, Paul Harrenstein, Keyvan Kardel, Hans Georg Seedig
2013 B conf
On Popular Random Assignments.
SAGT
Haris Aziz, Felix Brandt, Paul Stursberg
2013 J jnl
On the Rate of Convergence of Fictitious Play.
Theory Comput. Syst.
Felix Brandt, Felix A. Fischer, Paul Harrenstein
2013 A conf
On the tradeoff between economic efficiency and strategy proofness in randomized social choice.
AAMAS
Haris Aziz, Felix Brandt, Markus Brill
2013 J jnl
Pareto optimality in coalition formation.
Games Econ. Behav.
Haris Aziz, Felix Brandt, Paul Harrenstein
2013 J jnl
The Complexity of Computing Minimal Unidirectional Covering Sets.
Theory Comput. Syst.
Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe
2013 J jnl
The Computational Complexity of Random Serial Dictatorship
CoRR
Haris Aziz, Felix Brandt, Markus Brill
2013 — conf
The Computational Complexity of Random Serial Dictatorship.
WINE
Haris Aziz, Felix Brandt, Markus Brill
2012 A* conf
Computing dominance-based solution concepts.
EC
Felix Brandt, Markus Brill
2012 J jnl
Special Issue on Computational Foundations of Social Choice.
Math. Soc. Sci.
Felix Brandt, William S. Zwicker
2011 J jnl
Equilibria of graphical games with symmetries.
Theor. Comput. Sci.
Felix Brandt, Felix A. Fischer, Markus Holzer
2011 C conf
From Arrow's Impossibility to Schwartz's Tournament Equilibrium Set - (Invited Tutorial).
RAMiCS
Felix Brandt
2011 A* conf
Group-Strategyproof Irresolute Social Choice Functions.
IJCAI
Felix Brandt
2011 J jnl
Minimal stable sets in tournaments.
J. Econ. Theory
Felix Brandt
2011 B conf
Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions.
TARK
Felix Brandt, Markus Brill
2011 J jnl
On the Complexity of Iterated Weak Dominance in Constant-Sum Games.
Theory Comput. Syst.
Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein
2011 A* conf
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions.
IJCAI
Felix Brandt, Markus Brill, Hans Georg Seedig
2011 A* conf
Optimal Partitions in Additively Separable Hedonic Games.
IJCAI
Haris Aziz, Felix Brandt, Hans Georg Seedig
2011 B conf
Pareto Optimality in Coalition Formation.
SAGT
Haris Aziz, Felix Brandt, Paul Harrenstein
2011 J jnl
Set-rationalizable choice and self-stability.
J. Econ. Theory
Felix Brandt, Paul Harrenstein
2011 A conf
Stable partitions in additively separable hedonic games.
AAMAS
Haris Aziz, Felix Brandt, Hans Georg Seedig
2011 J jnl
The Computational Complexity of Weak Saddles.
Theory Comput. Syst.
Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann
2010 — conf
10101 Abstracts Collection - Computational Foundations of Social Choice.
Computational Foundations of Social Choice
Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker
2010 — conf
10101 Executive Summary - Computational Foundations of Social Choice.
Computational Foundations of Social Choice
Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker
2010 J jnl
A computational analysis of the tournament equilibrium set.
Soc. Choice Welf.
Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair
2010 — ch.
Auctions.
Handbook of Financial Cryptography and Security
Felix Brandt
2010 A* conf
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.
AAAI
Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra
2010 — ed.
Computational Foundations of Social Choice, 07.03. - 12.03.2010
Computational Foundations of Social Choice
Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker
2010 J jnl
Group-Strategyproof Irresolute Social Choice Functions
CoRR
Felix Brandt
2010 A conf
Minimal retentive sets in tournaments.
AAMAS
Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein
2010 A conf
Monotone cooperative games and their threshold versions.
AAMAS
Haris Aziz, Felix Brandt, Paul Harrenstein
2010 J jnl
On Iterated Dominance, Matrix Elimination, and Matched Paths
CoRR
Felix Brandt, Felix A. Fischer, Markus Holzer
2010 A conf
On Iterated Dominance, Matrix Elimination, and Matched Paths.
STACS
Felix Brandt, Felix A. Fischer, Markus Holzer
2010 B conf
On the Rate of Convergence of Fictitious Play.
SAGT
Felix Brandt, Felix A. Fischer, Paul Harrenstein
2010 J jnl
Optimal Partitions in Additively Separable Hedonic Games
CoRR
Haris Aziz, Felix Brandt, Hans Georg Seedig
2010 J jnl
Stable partitions in additively separable hedonic games
CoRR
Haris Aziz, Felix Brandt, Hans Georg Seedig
2010 C conf
The Complexity of Computing Minimal Unidirectional Covering Sets.
CIAC
Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe
2010 — conf
Tournament Solutions and Their Applications to Multiagent Decision Making.
MATES
Felix Brandt
2009 — conf
Computational aspects of Shapley's saddles.
AAMAS (1)
Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein
2009 J jnl
Computing Shapley's saddles.
SIGecom Exch.
Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jan Hoffmann
2009 J jnl
Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP
CoRR
Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jörg Rothe
2009 B conf
On the Complexity of Iterated Weak Dominance in Constant-Sum Games.
SAGT
Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein
2009 J jnl
Ranking games.
Artif. Intell.
Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham
2009 J jnl
Set-Rationalizable Choice and Self-Stability
CoRR
Felix Brandt, Paul Harrenstein
2009 J jnl
Some Remarks on Dodgson's Voting Rule.
Math. Log. Q.
Felix Brandt
2009 J jnl
Symmetries and the complexity of pure Nash equilibrium.
J. Comput. Syst. Sci.
Felix Brandt, Felix A. Fischer, Markus Holzer
2009 J jnl
The Computational Complexity of Choice Sets.
Math. Log. Q.
Felix Brandt, Felix A. Fischer, Paul Harrenstein
2009 B conf
The Computational Complexity of Weak Saddles.
SAGT
Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann
2008 A* conf
A Computational Analysis of the Tournament Equilibrium Set.
AAAI
Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair
2008 J jnl
Computing the minimal covering set.
Math. Soc. Sci.
Felix Brandt, Felix A. Fischer
2008 — conf
Equilibria of Graphical Games with Symmetries.
WINE
Felix Brandt, Felix A. Fischer, Markus Holzer
2008 J jnl
On Iterated Dominance, Matrix Elimination, and Matched Paths.
Electron. Colloquium Comput. Complex.
Felix Brandt, Felix A. Fischer, Markus Holzer
2008 J jnl
On the Existence of Unconditionally Privacy-Preserving Auction Protocols.
ACM Trans. Inf. Syst. Secur.
Felix Brandt, Tuomas Sandholm
2008 B conf
On the Hardness and Existence of Quasi-Strict Equilibria.
SAGT
Felix Brandt, Felix A. Fischer
2007 A* conf
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios.
IJCAI
Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham
2007 A conf
Commitment and extortion.
AAMAS
Paul Harrenstein, Felix Brandt, Felix A. Fischer
2007 A* conf
Computational Aspects of Covering in Dominance Graphs.
AAAI
Felix Brandt, Felix A. Fischer
2007 J jnl
Equilibria of Graphical Games with Symmetries.
Electron. Colloquium Comput. Complex.
Felix Brandt, Felix A. Fischer, Markus Holzer
2007 — conf
PageRank as a Weak Tournament Solution.
WINE
Felix Brandt, Felix A. Fischer
2007 J jnl
Recognizing Members of the Tournament Equilibrium Set is NP-hard
CoRR
Felix Brandt, Felix A. Fischer, Paul Harrenstein
2007 A* conf
Spiteful Bidding in Sealed-Bid Auctions.
IJCAI
Felix Brandt, Tuomas Sandholm, Yoav Shoham
2007 A conf
Symmetries and the Complexity of Pure Nash Equilibrium.
STACS
Felix Brandt, Felix A. Fischer, Markus Holzer
2007 B conf
The computational complexity of choice sets.
TARK
Felix Brandt, Felix A. Fischer, Paul Harrenstein
2006 J jnl
How to obtain full privacy in auctions.
Int. J. Inf. Sec.
Felix Brandt
2006 A* conf
On Strictly Competitive Multi-Player Games.
AAAI
Felix Brandt, Felix A. Fischer, Yoav Shoham
2006 J jnl
Symmetries and the Complexity of Pure Nash Equilibrium.
Electron. Colloquium Comput. Complex.
Felix Brandt, Felix A. Fischer, Markus Holzer
2005 A conf
Decentralized voting with unconditional privacy.
AAMAS
Felix Brandt, Tuomas Sandholm
2005 Misc conf
Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption.
ICISC
Felix Brandt
2005 — conf
Efficient Privacy-Preserving Protocols for Multi-unit Auctions.
Financial Cryptography
Felix Brandt, Tuomas Sandholm
2005 — conf
On Correctness and Privacy in Distributed Mechanisms.
AMEC@AAMAS/TADA@IJCAI
Felix Brandt, Tuomas Sandholm
2005 — conf
Spiteful Bidding in Sealed-Bid Auctions.
Computing and Markets
Felix Brandt, Tuomas Sandholm, Yoav Shoham
2005 B conf
Unconditional privacy in social choice.
TARK
Felix Brandt, Tuomas Sandholm
2004 A conf
Im)Possibility of Unconditionally Privacy-Preserving Auctions.
AAMAS
Felix Brandt, Tuomas Sandholm
2003 — conf
Fully Private Auctions in a Constant Number of Rounds.
Financial Cryptography
Felix Brandt
2003 — —
Fundamental aspects of privacy and deception in electronic auctions.
Felix Brandt
2003 A* conf
Social choice and preference protection: towards fully private mechanism design.
EC
Felix Brandt
2001 — conf
Antisocial Agents and Vickrey Auctions.
ATAL
Felix Brandt, Gerhard Weiß
2001 — conf
Cryptographic Protocols for Secure Second-Price Auctions.
CIA
Felix Brandt
2001 — conf
Vicious strategies for Vickrey auctions.
Agents
Felix Brandt, Gerhard Weiß
2000 — conf
Task Assignment in Multiagent Systems Based on Vickrey-Type Auctioning and Leveled Commitment Contracting.
CIA
Felix Brandt, Wilfried Brauer, Gerhard Weiß
1999 Misc conf
Using Term Space Maps to Capture Search Control Knowledge in Equational Theorem Proving.
FLAIRS
Stephan Schulz, Felix Brandt