Felix Fischer

Felix A. Fischer

EconCS Group
Harvard SEAS




Navigation About Contact Publications Teaching

About move to top of page
I am a postdoctoral research fellow in the Economics and Computer Science Research Group at Harvard University, and an affiliate of the Center for Research on Computation and Society. Before that, I was a founding member of the PAMAS group at LMU Munich, where I obtained a doctorate in Computer Science under the supervision of Felix Brandt. I use methods from game theory and computer science to study interactions among self-interested and computationally bounded agents and design mechanisms that mediate these interactions.

Contact Details move to top of page
E-Mail click to reveal address
PGP public key
Phone +1-617-495-0805
Fax +1-617-495-8612
Visitors Maxwell Dworkin 110
Mail Harvard SEAS
33 Oxford Street
Cambridge, MA 02138
USA

Publications move to top of page
Earlier publications on agent communication and autonomy are available upon request.

Copyright Notice: All material on this page is copyright by the authors or other copyright holders. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and bear the full citation and a possible copyright notice on the first page. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. In particular, work published in the Springer LNCS Series is © Springer-Verlag.

Journal Articles
 
F. Fischer, A. D. Procaccia, and A. Samorodnitsky. A new perspective on implementation by voting trees. Random Structures and Algorithms, 39(1):59–82, 2011. Earlier version appeared in the Proceedings of the 10th ACM Conference on Electronic Commerce.
.pdf | .ps.gz | link | slides ]
 
F. Brandt, M. Brill, F. Fischer, and J. Hoffmann. The computational complexity of weak saddles. Theory of Computing Systems, 49(1):139–161, 2011. Earlier version appeared in the Proceedings of the 2nd International Symposium on Algorithmic Game Theory.
.pdf | .ps.gz | link ]
 
F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. On the complexity of iterated weak dominance in constant-sum games. Theory of Computing Systems, 49(1):162–181, 2011. Earlier version appeared in the Proceedings of the 2nd International Symposium on Algorithmic Game Theory.
.pdf | .ps.gz | link ]
 
F. Brandt, F. Fischer, and M. Holzer. Equilibria of graphical games with symmetries. Theoretical Computer Science, 412(8–10):675–685, 2011. Earlier version appeared in the Proceedings of the 4th International Workshop on Internet and Network Economics.
.pdf | .ps.gz | link ]
 
O. Dekel, F. Fischer, and A. D. Procaccia. Incentive compatible regression learning. Journal of Computer and System Sciences, 76(8):759–777, 2010. Earlier version appeared in the Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms.
.pdf | .ps.gz | link | slides ]
 
F. Brandt, F. Fischer, P. Harrenstein, and M. Mair. A computational analysis of the tournament equilibrium set. Social Choice and Welfare, 34(4):597–609, 2010. Earlier version appeared in the Proceedings of the 23rd AAAI Conference on Artificial Intelligence.
.pdf | .ps.gz | link ]
 
F. Brandt, M. Brill, F. Fischer, P. Harrenstein, and J. Hoffmann. Computing Shapley's saddles. ACM SIGecom Exchanges, 8(2), 2009.
.pdf | .ps.gz | link ]
 
F. Brandt, F. Fischer, P. Harrenstein, and Y. Shoham. Ranking games. Artificial Intelligence, 173(2):221–239, 2009. Revised and extended version of the AAAI 2006 and IJCAI 2007 papers titled ”On Strictly Competitive Multi-Player Games” and ”A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios”.
.pdf | .ps.gz | link ]
 
F. Brandt, F. Fischer, and P. Harrenstein. The computational complexity of choice sets. Mathematical Logic Quarterly, 55(4):444–459, 2009. Earlier version appeared in the Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge. Also presented at the 1st International Workshop on Computational Social Choice.
.pdf | .ps.gz | link ]
 
F. Brandt, F. Fischer, and M. Holzer. Symmetries and the complexity of pure Nash equilibrium. Journal of Computer and System Sciences, 75(3):163–177, 2009. Earlier version appeared in the Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science.
.pdf | .ps.gz | link | slides ]
 
F. Brandt and F. Fischer. Computing the minimal covering set. Mathematical Social Sciences, 56(2):254–268, 2008. Revised and extended version of a AAAI 2007 paper titled ”Computational Aspects of Covering in Dominance Graphs”, also presented at the 5th International Conference on Logic, Game Theory and Social Choice.
.pdf | .ps.gz | link | slides ]
 
F. Fischer, M. Holzer, and S. Katzenbeisser. The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. Information Processing Letters, 99(6):239–245, 2006.
.pdf | .ps.gz | link | slides ]
 
Papers in Conference and Workshop Proceedings
 
N. Alon, F. Fischer, A. D. Procaccia, and M. Tennenholtz. Sum of us: Strategyproof selection from the selectors. In Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge, pages 101–110. ACM Press, 2011. Best paper. Also presented at the 3rd International Workshop on Computational Social Choice.
.pdf | .ps.gz | report | slides | venue | venue ]
 
P. Dütting, F. Fischer, and D. C. Parkes. Simplicity-expressiveness tradeoffs in mechanism design. In Y. Shoham, Y. Chen, and T. Roughgarden, editors, Proceedings of the 12th ACM Conference on Electronic Commerce, pages 341–350. ACM Press, 2011.
.pdf | .ps.gz | link | report | venue ]
 
F. Brandt, F. Fischer, and P. Harrenstein. On the rate of convergence of fictitious play. In S. Kontogiannis, E. Koutsoupias, and P. G. Spirakis, editors, Proceedings of the 3rd International Symposium on Algorithmic Game Theory, volume 6386 of Lecture Notes in Computer Science, pages 102–113. Springer-Verlag, 2010.
.pdf | .ps.gz | link | venue ]
 
I. Ashlagi, F. Fischer, I. A. Kash, and A. D. Procaccia. Mix and match. In D. C. Parkes, C. Dellarocas, and M. Tennenholtz, editors, Proceedings of the 11th ACM Conference on Electronic Commerce, pages 305–314. ACM Press, 2010.
.pdf | .ps.gz | link | slides | venue ]
 
D. Baumeister, F. Brandt, F. Fischer, J. Hoffmann, and J. Rothe. The complexity of computing minimal unidirectional covering sets. In T. Calamoneri and J. Diaz, editors, Proceedings of the 7th International Conference on Algorithms and Complexity, volume 6078 of Lecture Notes in Computer Science, pages 299–310. Springer-Verlag, 2010.
.pdf | .ps.gz | link | report | venue ]
 
F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. Minimal retentive sets in tournaments. In W. van der Hoek and G. A. Kaminka, editors, Proceedings of the 9th International Joint Conference on Autonomous Agents and Multi-Agent Systems, pages 47–54, 2010.
.pdf | .ps.gz | link | venue ]
 
F. Brandt, F. Fischer, and M. Holzer. On iterated dominance, matrix elimination, and matched paths. In J.-Y. Marion and T. Schwentick, editors, Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, pages 107–118, 2010. Earlier version published as ECCC Report TR08-077.
.pdf | .ps.gz | link | report | venue ]
 
F. Brandt, M. Brill, F. Fischer, and J. Hoffmann. The computational complexity of weak saddles. In M. Mavronicolas and V. G. Papadopoulou, editors, Proceedings of the 2nd International Symposium on Algorithmic Game Theory, volume 5814 of Lecture Notes in Computer Science, pages 238–249. Springer-Verlag, 2009.
newer version | link | venue ]
 
F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. On the complexity of iterated weak dominance in constant-sum games. In M. Mavronicolas and V. G. Papadopoulou, editors, Proceedings of the 2nd International Symposium on Algorithmic Game Theory, volume 5814 of Lecture Notes in Computer Science, pages 287–298. Springer-Verlag, 2009.
newer version | link | venue ]
 
F. Fischer, A. D. Procaccia, and A. Samorodnitsky. A new perspective on implementation by voting trees. In J. Chuang, L. Fortnow, and P. Pu, editors, Proceedings of the 10th ACM Conference on Electronic Commerce, pages 31–40. ACM Press, 2009. Supersedes ”On Voting Caterpillars: Approximating Maximum Degree in a Tournament by Binary Trees”, Technical Report 2008-06, Leibniz Center for Research in Computer Science, The Hebrew University of Jerusalem. Also presented at the 2nd International Workshop on Computational Social Choice.
newer version | link | report | venue | venue ]
 
F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. Computational aspects of Shapley's saddles. In K. S. Decker, J. S. Sichman, C. Sierra, and C. Castelfranchi, editors, Proceedings of the 8th International Joint Conference on Autonomous Agents and Multi-Agent Systems, pages 209–216, 2009.
.pdf | .ps.gz | link | venue ]
 
F. Brandt, F. Fischer, and M. Holzer. Equilibria of graphical games with symmetries. In C. H. Papadimitriou and S. Zhang, editors, Proceedings of the 4th International Workshop on Internet and Network Economics, Lecture Notes in Computer Science, pages 198–209. Springer-Verlag, 2008. Earlier version published as ECCC Report TR07-136.
newer version | link | report | venue ]
 
F. Brandt, F. Fischer, P. Harrenstein, and M. Mair. A computational analysis of the tournament equilibrium set. In D. Fox and C. P. Gomes, editors, Proceedings of the 23rd AAAI Conference on Artificial Intelligence, pages 38–43. AAAI Press, 2008. Supersedes ”Recognizing Members of the Tournament Equilibrium Set is NP-hard” by Brandt, Fischer, and Harrenstein, arXiv:0711.2961. Also presented at the 2nd International Workshop on Computational Social Choice.
newer version | report | venue | venue ]
 
F. Brandt and F. Fischer. On the hardness and existence of quasi-strict equilibria. In B. Monien and U.-P. Schroeder, editors, Proceedings of the 1st International Symposium on Algorithmic Game Theory, volume 4997 of Lecture Notes in Computer Science, pages 291–302. Springer-Verlag, 2008.
.pdf | .ps.gz | link | slides | venue ]
 
O. Dekel, F. Fischer, and A. D. Procaccia. Incentive compatible regression learning. In S.-H. Teng, editor, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 884–893. SIAM, 2008. Earlier version presented at the Dagstuhl Seminar on Computational Social Systems and the Internet and published as Leibniz Center Technical Report 2007-112.
newer version | link | report | venue ]
 
F. Brandt and F. Fischer. PageRank as a weak tournament solution. In X. Deng and F. Chung Graham, editors, Proceedings of the 3rd International Workshop on Internet and Network Economics, volume 4858 of Lecture Notes in Computer Science, pages 300–305. Springer-Verlag, 2007.
.pdf | .ps.gz | link | venue ]
 
F. Brandt and F. Fischer. Computational aspects of covering in dominance graphs. In R. C. Holte and A. Howe, editors, Proceedings of the 22nd AAAI Conference on Artificial Intelligence, pages 694–699. AAAI Press, 2007. Also presented at the 5th International Conference on Logic, Game Theory and Social Choice.
newer version | link | venue ]
 
F. Brandt, F. Fischer, and P. Harrenstein. The computational complexity of choice sets. In D. Samet, editor, Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge, pages 82–91. ACM Press, 2007. Earlier version presented at the 1st International Workshop on Computational Social Choice.
newer version | link | venue | venue ]
 
P. Harrenstein, F. Brandt, and F. Fischer. Commitment and extortion. In M. Huhns and O. Shehory, editors, Proceedings of the 6th International Joint Conference on Autonomous Agents and Multi-Agent Systems, pages 108–115. ACM Press, 2007.
.pdf | .ps.gz | link | venue ]
 
F. Brandt, F. Fischer, and M. Holzer. Symmetries and the complexity of pure Nash equilibrium. In W. Thomas and P. Weil, editors, Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science, volume 4393 of Lecture Notes in Computer Science, pages 212–223. Springer-Verlag, 2007. Earlier version presented at the 17th International Conference on Game Theory and published as ECCC Report TR06-091.
newer version | link | report | venue ]
 
F. Brandt, F. Fischer, P. Harrenstein, and Y. Shoham. A game-theoretic analysis of strictly competitive multiagent scenarios. In M. Veloso, editor, Proceedings of the 20th International Joint Conference on Artificial Intelligence, pages 1199–1206, 2007.
newer version | link | slides | venue ]
 
F. Brandt, F. Fischer, and Y. Shoham. On strictly competitive multi-player games. In Y. Gil and R. Mooney, editors, Proceedings of the 21st National Conference on Artificial Intelligence, pages 605–612. AAAI Press, 2006. Also presented at the 17th International Conference on Game Theory.
newer version | link | venue ]
 
Thesis
 
F. Fischer. Complexity results for some classes of strategic games. Dissertation, Fakultät für Mathematik, Informatik und Statistik, Ludwig-Maximilians-Universität München, 2009.
.pdf | .ps.gz | link | slides ]
 
This bibliography has been generated by bibtex2html.

Teaching move to top of page
(in German)
WS 09/10: Hauptseminar Multiagentensysteme
WS 08/09: Algorithmische Graphentheorie [Übung]
SS 07: Multiagentensysteme [Übung]
WS 06/07: Hauptseminar Multiagentensysteme
SS 06: Hauptseminar Spieltheorie
WS 05/06: Hauptseminar Spieltheorie, Proseminar UNIX Tools
SS 05: Praktikum Game Playing, Proseminar UNIX Tools
WS 04/05: Praktikum Game Playing
WS 02/03: Programmierpraktikum Methoden der künstlichen Intelligenz
SS 02: Einführung in die Informatik IV [Tutorübung]


Felix Fischer
Last Modified: Thursday, 27-Oct-2011 17:22:24 CEST
Valid XHTML 1.0
Links checked