- The Complexity of Computing Minimal Unidirectional Covering Sets
- Draft February 11, 2010 On the Rate of Convergence of Fictitious
- Symmetries and the Complexity of Pure Nash Equilibrium
- The Influence of Neighbourhood and Choice on the Complexity of Finding Pure Nash Equilibria
- Incentive Compatible Regression Learning I Ofer Dekel a,1 , Felix Fischer #,b,2 , Ariel D. Procaccia b,3
- Equilibria of Graphical Games with Symmetries I Felix Brandt a , Felix Fischer #,b , Markus Holzer c
- Sum of Us: Strategyproof Selection from the Selectors Noga Alon # Felix Fischer + Ariel D. Procaccia # Moshe Tennenholtz
- Preliminary Draft --September 13, 2007 PageRank as a Weak Tournament Solution #
- Equilibria of Graphical Games with Symmetries$ Felix Brandta
- Minimal Retentive Sets in Tournaments Felix Brandt Markus Brill Felix Fischer Paul Harrenstein
- Complexity Results for Some Classes of Strategic Games
- Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacs-conf.org
- Sum of Us: Strategyproof Selection from the Selectors Noga Alon Felix Fischer Ariel D. Procaccia Moshe Tennenholtz
- A New Perspective on Implementation by Voting Trees # Felix Fischer + Ariel D. Procaccia # Alex Samorodnitsky
- The Influence of Neighbourhood and Choice on the Complexity of Finding Pure Nash Equilibria
- Incentive Compatible Regression Learning$ Ofer Dekela,1
- The Complexity of Computing Minimal Unidirectional Covering Sets #
- Computing Shapley's Saddles FELIX BRANDT, MARKUS BRILL, FELIX FISCHER, PAUL HARRENSTEIN, JAN
- Computing the Minimal Covering Set Felix Brandt # Felix Fischer
- Commitment and Extortion # Paul Harrenstein
- Draft --February 11, 2010 On the Rate of Convergence of Fictitious
- Preprint submitted to Social Choice and Welfare August 10, 2009
- Simplicity-Expressiveness Tradeoffs in Mechanism Design Paul Dutting
- Complexity Results for Some Classes of Strategic Games
- Mix and Match Itai Ashlagi
- Preprint submitted to Theory of Computing Systems November 22, 2010
- Preprint submitted to Theory of Computing Systems November 22, 2010
- SimplicityExpressiveness Tradeo#s in Mechanism Design Paul Dutting # Felix Fischer + David C. Parkes #
- Draft --October 16, 2008 Computational Aspects of Shapley's Saddles
- Minimal Retentive Sets in Tournaments Felix Brandt Markus Brill Felix Fischer Paul Harrenstein
- Ranking Games Felix Brandt a,# Felix Fischer a Paul Harrenstein a
- Preprint submitted to Social Choice and Welfare August 10, 2009
- The Computational Complexity of Choice Sets Felix Brandt # , Felix Fischer, and Paul Harrenstein
- On the Hardness and Existence of QuasiStrict Equilibria #
- Draft October 16, 2008 Computational Aspects of Shapley's Saddles
- Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacsconf.org
- Computing the Minimal Covering Set Felix Brandt Felix Fischer
- Commitment and Extortion Paul Harrenstein
- A New Perspective on Implementation by Voting Trees Felix Fischer
