F. Fischer, O. Hudry, and R. Niedermeier. 2016. Weighted Tournament Solutions. In Handbook of Computational Social Choice, 85–102. Cambridge University Press.
P. Dütting, F. Fischer, and D. C. Parkes. 2024. Non-Truthful Position Auctions Are More Robust to Misspecification. Mathematics of Operations Research 49(2), 901–27.
J. Cembrano, F. Fischer, D. Hannon, and M. Klimm. 2024. Impartial Selection with Additive Guarantees via Iterated Deletion. Games and Economic Behavior 144, 203–24.
J. Correa, P. Dütting, F. Fischer, and K. Schewior. 2022. Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution. Mathematics of Operations Research 47(2), 1287–1309.
F. Eberle, F. Fischer, J. Matuschke, and N. Megow. 2019. On Index Policies for Stochastic Minsum Scheduling. Operations Research Letters 47(3), 213–18.
P. Dütting, F. Fischer, and D. C. Parkes. 2019. Expressiveness and Robustness of First-Price Position Auctions. Mathematics of Operations Research 44(1), 196–211.
A. Bjelde, F. Fischer, and M. Klimm. 2017. Impartial Selection and the Power of Up to Two Choices. ACM Transactions on Economics and Computation 5(4), 21:1–21:20.
H. Aziz, M. Brill, F. Fischer, P. Harrenstein, J. Lang, and H. G. Seedig. 2015. Possible and Necessary Winners of Partial Tournaments. Journal of Artificial Intelligence Research 54, 493–534.
I. Ashlagi, F. Fischer, I. A. Kash, and A. D. Procaccia. 2015. Mix and Match: A Strategyproof Mechanism for Multi-Hospital Kidney Exchange. Games and Economic Behavior 91, 284–96.
P. Dütting, F. Fischer, P. Jirapinyo, J. Lai, B. Lubin, and D. C. Parkes. 2015. Payment Rules through Discriminant-Based Classifiers. ACM Transactions on Economics and Computation 3(1), 5:1–5:41.
D. Baumeister, F. Brandt, F. Fischer, J. Hoffmann, and J. Rothe. 2013. The Complexity of Computing Minimal Unidirectional Covering Sets. Theory of Computing Systems 53(3), 467–502.
F. Fischer, A. D. Procaccia, and A. Samorodnitsky. 2011. A New Perspective on Implementation by Voting Trees. Random Structures and Algorithms 39(1), 59–82.
F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. 2011. On The Complexity of Iterated Weak Dominance in Constant-Sum Games. Theory of Computing Systems 49(1), 162–81.
F. Brandt, F. Fischer, P. Harrenstein, and M. Mair. 2010. A Computational Analysis of the Tournament Equilibrium Set. Social Choice and Welfare 34(4), 597–609.
F. Brandt, F. Fischer, and M. Holzer. 2009. Symmetries and the Complexity of Pure Nash Equilibrium. Journal of Computer and System Sciences 75(3), 163–77.
F. Fischer, M. Holzer, and S. Katzenbeisser. 2006. The Influence of Neighbourhood and Choice on the Complexity of Finding Pure Nash Equilibria. Information Processing Letters 99(6). Elsevier, 239–45.
J. Cembrano, F. Fischer, and M. Klimm. 2023. Improved Bounds for Single-Nomination Impartial Selection. In Proceedings of the 24th ACM Conference on Economics and Computation, 449.
J. Cembrano, F. Fischer, and M. Klimm. 2022. Optimal Impartial Correspondences. In Proceedings of the 18th Conference on Web and Internet Economics, 187–203.
J. Cembrano, F. Fischer, D. Hannon, and M. Klimm. 2022. Impartial Selection with Additive Guarantees via Iterated Deletion. In Proceedings of the 23rd ACM Conference on Economics and Computation, 1104–5.
J. Correa, P. Dütting, F. Fischer, K. Schewior, and B. Ziliotto. 2021. Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility. In Proceedings of the 12th Innovations in Theoretical Computer Science Conference.
J. Correa, P. Dütting, F. Fischer, and K. Schewior. 2019. Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution. In Proceedings of the 20th ACM Conference on Economics and Computation, 3–17.
F. Eberle, F. Fischer, J. Matuschke, and N. Megow. 2018. On Index Policies in Stochastic Scheduling. In Proceedings of the 16th International Conference on Project Management and Scheduling.
P. Dütting, F. Fischer, and D. C. Parkes. 2016. Truthful Outcomes from Non-Truthful Position Auctions. In Proceedings of the 17th ACM Conference on Economics and Computation, 813. ACM Press.
A. Bjelde, F. Fischer, and M. Klimm. 2015. Impartial Selection and the Power of Up to Two Choices. In Proceedings of the 11th Conference on Web and Internet Economics, 146–58. Springer-Verlag.
F. Fischer, and M. Klimm. 2014. Optimal Impartial Selection. In Proceedings of the 15th ACM Conference on Economics and Computation, 803–20. ACM Press.
P. Dütting, F. Fischer, and D. C. Parkes. 2014. Expressiveness and Robustness of First-Price Position Auctions. In Proceedings of the 15th ACM Conference on Economics and Computation, 57–74. ACM Press.
M. Brill, and F. Fischer. 2012. The Price of Neutrality for the Ranked Pairs Method. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, 1299–1305. AAAI Press.
P. Dütting, F. Fischer, P. Jirapinyo, J. Lai, B. Lubin, and D. C. Parkes. 2012. Payment Rules through Discriminant-Based Classifiers. In Proceedings of the 13th ACM Conference on Electronic Commerce, 477–94. ACM Press.
H. Aziz, M. Brill, F. Fischer, P. Harrenstein, J. Lang, and H. G. Seedig. 2012. Possible and Necessary Winners of Partial Tournaments. In Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems, 585–92. ACM Press.
N. Alon, F. Fischer, A. D. Procaccia, and M. Tennenholtz. 2011. Sum of Us: Strategyproof Selection from the Selectors. In Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge, 101–10. ACM Press.
P. Dütting, F. Fischer, and D. C. Parkes. 2011. Simplicity-Expressiveness Tradeoffs in Mechanism Design. In Proceedings of the 12th ACM Conference on Electronic Commerce, 341–50. ACM Press.
F. Brandt, F. Fischer, and P. Harrenstein. 2010. On the Rate of Convergence of Fictitious Play. In Proceedings of the 3rd International Symposium on Algorithmic Game Theory, 102–13. Springer-Verlag.
I. Ashlagi, F. Fischer, I. A. Kash, and A. D. Procaccia. 2010. Mix and Match. In Proceedings of the 11th ACM Conference on Electronic Commerce, 305–14. ACM Press.
D. Baumeister, F. Brandt, F. Fischer, J. Hoffmann, and J. Rothe. 2010. The Complexity of Computing Minimal Unidirectional Covering Sets. In Proceedings of the 7th International Conference on Algorithms and Complexity, 299–310. Springer-Verlag.
F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. 2010. Minimal Retentive Sets in Tournaments. In Proceedings of the 9th International Joint Conference on Autonomous Agents and Multi-Agent Systems, 47–54. ACM Press.
F. Brandt, F. Fischer, and M. Holzer. 2010. On Iterated Dominance, Matrix Elimination, and Matched Paths. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 107–18.
F. Brandt, M. Brill, F. Fischer, and J. Hoffmann. 2009. The Computational Complexity of Weak Saddles. In Proceedings of the 2nd International Symposium on Algorithmic Game Theory, 238–49. Springer-Verlag.
F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. 2009. On The Complexity of Iterated Weak Dominance in Constant-Sum Games. In Proceedings of the 2nd International Symposium on Algorithmic Game Theory, 287–98. Springer-Verlag.
F. Fischer, A. D. Procaccia, and A. Samorodnitsky. 2009. A New Perspective on Implementation by Voting Trees. In Proceedings of the 10th ACM Conference on Electronic Commerce, 31–40. ACM Press.
F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. 2009. Computational Aspects of Shapley’s Saddles. In Proceedings of the 8th International Joint Conference on Autonomous Agents and Multi-Agent Systems, 209–16. ACM Press.
F. Brandt, F. Fischer, and M. Holzer. 2008. Equilibria of Graphical Games with Symmetries. In Proceedings of the 4th Workshop on Internet and Network Economics, 198–209. Springer-Verlag.
F. Brandt, F. Fischer, P. Harrenstein, and M. Mair. 2008. A Computational Analysis of the Tournament Equilibrium Set. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence, 38–43. AAAI Press.
F. Brandt, and F. Fischer. 2008. On the Hardness and Existence of Quasi-Strict Equilibria. In Proceedings of the 1st International Symposium on Algorithmic Game Theory, 291–302. Springer-Verlag.
O. Dekel, F. Fischer, and A. D. Procaccia. 2008. Incentive Compatible Regression Learning. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, 884–93. SIAM.
F. Brandt, and F. Fischer. 2007. PageRank as a Weak Tournament Solution. In Proceedings of the 3rd Workshop on Internet and Network Economics, 300–305. Springer-Verlag.
F. Brandt, and F. Fischer. 2007. Computational Aspects of Covering in Dominance Graphs. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence, 694–99. AAAI Press.
F. Brandt, F. Fischer, and P. Harrenstein. 2007. The Computational Complexity of Choice Sets. In Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge, 82–91. ACM Press.
P. Harrenstein, F. Brandt, and F. Fischer. 2007. Commitment and Extortion. In Proceedings of the 6th International Joint Conference on Autonomous Agents and Multi-Agent Systems, 108–15. ACM Press.
F. Brandt, F. Fischer, and M. Holzer. 2007. Symmetries and the Complexity of Pure Nash Equilibrium. In Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science, 212–23. Springer-Verlag.
F. Brandt, F. Fischer, P. Harrenstein, and Y. Shoham. 2007. A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios. In Proceedings of the 20th International Joint Conference on Artificial Intelligence , 1199–1206.
F. Brandt, F. Fischer, and Y. Shoham. 2006. On Strictly Competitive Multi-Player Games. In Proceedings of the 21st National Conference on Artificial Intelligence, 605–12. AAAI Press.
F. Fischer. 2009. Complexity Results for Some Classes of Strategic Games. Dissertation, Fakultät für Mathematik, Informatik und Statistik, Ludwig-Maximilians-Universität München.
