Felix Brandt

Haris Aziz, Felix Brandt, Hans Georg Seedig: Computing desirable partitions in additively separable hedonic games. Artif. Intell. 195: 316-334 (2013)

Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé: A counterexample to a conjecture of Schwartz. Social Choice and Welfare 40(3): 739-743 (2013)

Felix Brandt, Hans Georg Seedig: A tournament of order 24 with two disjoint TEQ-retentive sets. CoRR abs/1302.5592 (2013)

Haris Aziz, Felix Brandt, Markus Brill: The Computational Complexity of Random Serial Dictatorship. CoRR abs/1304.3169 (2013)

Felix Brandt, William S. Zwicker: Special Issue on Computational Foundations of Social Choice. Mathematical Social Sciences 64(1): 1 (2012)

Felix Brandt, Markus Brill: Computing dominance-based solution concepts. ACM Conference on Electronic Commerce 2012: 233

Felix Brandt: Minimal stable sets in tournaments. J. Economic Theory 146(4): 1481-1499 (2011)

Felix Brandt, Paul Harrenstein: Set-rationalizable choice and self-stability. J. Economic Theory 146(4): 1721-1731 (2011)

Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann: The Computational Complexity of Weak Saddles. Theory Comput. Syst. 49(1): 139-161 (2011)

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

Felix Brandt, Felix A. Fischer, Markus Holzer: Equilibria of graphical games with symmetries. Theor. Comput. Sci. 412(8-10): 675-685 (2011)

Felix Brandt: From Arrow's Impossibility to Schwartz's Tournament Equilibrium Set - (Invited Tutorial). RAMICS 2011: 50-51

Haris Aziz, Felix Brandt, Hans Georg Seedig: Stable partitions in additively separable hedonic games. AAMAS 2011: 183-190

Haris Aziz, Felix Brandt, Hans Georg Seedig: Optimal Partitions in Additively Separable Hedonic Games. IJCAI 2011: 43-48

Felix Brandt: Group-Strategyproof Irresolute Social Choice Functions. IJCAI 2011: 79-84

Felix Brandt, Markus Brill, Hans Georg Seedig: On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. IJCAI 2011: 85-90

Haris Aziz, Felix Brandt, Paul Harrenstein: Pareto Optimality in Coalition Formation. SAGT 2011: 93-104

Felix Brandt, Markus Brill: Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions. TARK 2011: 136-142

Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair: A computational analysis of the tournament equilibrium set. Social Choice and Welfare 34(4): 597-609 (2010)

Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra: Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI 2010

Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein: Minimal retentive sets in tournaments. AAMAS 2010: 47-58

Haris Aziz, Felix Brandt, Paul Harrenstein: Monotone cooperative games and their threshold versions. AAMAS 2010: 1107-1114

Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe: The Complexity of Computing Minimal Unidirectional Covering Sets. CIAC 2010: 299-310

Felix Brandt: Tournament Solutions and Their Applications to Multiagent Decision Making. MATES 2010: 1

Felix Brandt, Felix A. Fischer, Paul Harrenstein: On the Rate of Convergence of Fictitious Play. SAGT 2010: 102-113

Felix Brandt, Felix A. Fischer, Markus Holzer: On Iterated Dominance, Matrix Elimination, and Matched Paths. STACS 2010: 107-118

Felix Brandt, Felix A. Fischer, Markus Holzer: On Iterated Dominance, Matrix Elimination, and Matched Paths. CoRR abs/1001.0529 (2010)

Haris Aziz, Felix Brandt, Hans Georg Seedig: Optimal Partitions in Additively Separable Hedonic Games. CoRR abs/1005.4540 (2010)

Felix Brandt: Group-Strategyproof Irresolute Social Choice Functions. CoRR abs/1005.4877 (2010)

Haris Aziz, Felix Brandt, Hans Georg Seedig: Stable partitions in additively separable hedonic games. CoRR abs/1008.0074 (2010)

Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham: Ranking games. Artif. Intell. 173(2): 221-239 (2009)

Felix Brandt, Felix A. Fischer, Markus Holzer: Symmetries and the complexity of pure Nash equilibrium. J. Comput. Syst. Sci. 75(3): 163-177 (2009)

Felix Brandt, Felix A. Fischer, Paul Harrenstein: The Computational Complexity of Choice Sets. Math. Log. Q. 55(4): 444-459 (2009)

Felix Brandt: Some Remarks on Dodgson's Voting Rule. Math. Log. Q. 55(4): 460-463 (2009)

Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jan Hoffmann: Computing Shapley's saddles. SIGecom Exchanges 8(2): 3 (2009)

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

Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann: The Computational Complexity of Weak Saddles. SAGT 2009: 238-249

Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein: On the Complexity of Iterated Weak Dominance in Constant-Sum Games. SAGT 2009: 287-298

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

Felix Brandt, Paul Harrenstein: Set-Rationalizable Choice and Self-Stability. CoRR abs/0910.3580 (2009)

Felix Brandt, Felix A. Fischer: Computing the minimal covering set. Mathematical Social Sciences 56(2): 254-268 (2008)

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

Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair: A Computational Analysis of the Tournament Equilibrium Set. AAAI 2008: 38-43

Felix Brandt, Felix A. Fischer: On the Hardness and Existence of Quasi-Strict Equilibria. SAGT 2008: 291-302

Felix Brandt, Felix A. Fischer, Markus Holzer: Equilibria of Graphical Games with Symmetries. WINE 2008: 198-209

Felix Brandt, Felix A. Fischer, Markus Holzer: On Iterated Dominance, Matrix Elimination, and Matched Paths. Electronic Colloquium on Computational Complexity (ECCC) 15(077) (2008)

Felix Brandt, Felix A. Fischer: Computational Aspects of Covering in Dominance Graphs. AAAI 2007: 694-699

Paul Harrenstein, Felix Brandt, Felix A. Fischer: Commitment and extortion. AAMAS 2007: 26

Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham: A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios. IJCAI 2007: 1199-1206

Felix Brandt, Tuomas Sandholm, Yoav Shoham: Spiteful Bidding in Sealed-Bid Auctions. IJCAI 2007: 1207-1214

Felix Brandt, Felix A. Fischer, Markus Holzer: Symmetries and the Complexity of Pure Nash Equilibrium. STACS 2007: 212-223

Felix Brandt, Felix A. Fischer, Paul Harrenstein: The computational complexity of choice sets. TARK 2007: 82-91

Felix Brandt, Felix A. Fischer: PageRank as a Weak Tournament Solution. WINE 2007: 300-305

Felix Brandt, Felix A. Fischer, Paul Harrenstein: Recognizing Members of the Tournament Equilibrium Set is NP-hard. CoRR abs/0711.2961 (2007)

Felix Brandt, Felix A. Fischer, Markus Holzer: Equilibria of Graphical Games with Symmetries. Electronic Colloquium on Computational Complexity (ECCC) 14(136) (2007)

Felix Brandt: How to obtain full privacy in auctions. Int. J. Inf. Sec. 5(4): 201-216 (2006)

Felix Brandt, Felix A. Fischer, Yoav Shoham: On Strictly Competitive Multi-Player Games. AAAI 2006: 605-612

Felix Brandt, Felix A. Fischer, Markus Holzer: Symmetries and the Complexity of Pure Nash Equilibrium. Electronic Colloquium on Computational Complexity (ECCC) 13(091) (2006)

Felix Brandt, Tuomas Sandholm: Decentralized voting with unconditional privacy. AAMAS 2005: 357-364

Felix Brandt, Tuomas Sandholm, Yoav Shoham: Spiteful Bidding in Sealed-Bid Auctions. Computing and Markets 2005

Felix Brandt, Tuomas Sandholm: Efficient Privacy-Preserving Protocols for Multi-unit Auctions. Financial Cryptography 2005: 298-312

Felix Brandt: Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption. ICISC 2005: 32-47

Felix Brandt, Tuomas Sandholm: Unconditional privacy in social choice. TARK 2005: 207-218

Felix Brandt, Tuomas Sandholm: Im)Possibility of Unconditionally Privacy-Preserving Auctions. AAMAS 2004: 810-817

Felix Brandt: Fundamental aspects of privacy and deception in electronic auctions. Technical University Munich 2003

Felix Brandt: Fully Private Auctions in a Constant Number of Rounds. Financial Cryptography 2003: 223-238

Felix Brandt: Social choice and preference protection: towards fully private mechanism design. ACM Conference on Electronic Commerce 2003: 220-221

Felix Brandt, Gerhard Weiß: Vicious strategies for Vickrey auctions. Agents 2001: 71-72

Felix Brandt, Gerhard Weiß: Antisocial Agents and Vickrey Auctions. ATAL 2001: 335-347

Felix Brandt: Cryptographic Protocols for Secure Second-Price Auctions. CIA 2001: 154-165

Felix Brandt, Wilfried Brauer, Gerhard Weiß: Task Assignment in Multiagent Systems Based on Vickrey-Type Auctioning and Leveled Commitment Contracting. CIA 2000: 95-106

Stephan Schulz, Felix Brandt: Using Term Space Maps to Capture Search Control Knowledge in Equational Theorem Proving. FLAIRS Conference 1999: 244-248