School of Mathematical Sciences

Dr Felix Fischer

Felix

Lecturer in Optimisation/Operations Research

Email: felix.fischer@qmul.ac.uk
Telephone: +44 (0)20 7882 2607
Room Number: Mathematical Sciences Building, Room: MB-G23
Website: http://www.maths.qmul.ac.uk/~ffischer
Office Hours: Tuesday 13:30-14:30

Profile

Felix Fischer is a Lecturer in Optimisation and Operations Research in the School of Mathematical Sciences at Queen Mary University of London. He uses models and techniques from algorithmics, game theory, mechanism design, optimisation, and applied probability to study systems in which strategic behavior of individuals leads to good overall outcomes.

Research

Publications

  • Eberle F, Fischer F, Matuschke J et al. (2019). On index policies for stochastic minsum scheduling Operations Research Letters.
  • Dütting P, FISCHER FA, Parkes DC (2018). Expressiveness And Robustness of First-Price Position Auctions Mathematics of Operations Research.
  • Bjelde A, Fischer F, Klimm M (2017). Impartial Selection and the Power of Up to Two Choices ACM Transactions on Economics and Computation.
  • Fischer F, Hudry O, Niedermeier R (2016). Weighted Tournament Solutions journal.
  • Ashlagi I, Fischer F, Kash IA et al. (2015). Mix and Match: A Strategyproof Mechanism for Multi-Hospital Kidney Exchange Games and Economic Behavior.
  • Fischer F, Klimm M (2015). Optimal Impartial Selection SIAM Journal on Computing.
  • Dütting P, Fischer F, Jirapinyo P et al. (2015). Payment Rules through Discriminant-Based Classifiers ACM Transactions on Economics and Computation.
  • Aziz H, Brill M, Fischer F et al. (2015). Possible and Necessary Winners of Partial Tournaments Journal of Artificial Intelligence Research.
  • Brandt F, Brill M, Fischer F et al. (2014). Minimal Retentive Sets in Tournaments Social Choice and Welfare.
  • Brandt F, Fischer F, Harrenstein P (2013). On the Rate of Convergence of Fictitious Play Theory of Computing Systems.
  • Baumeister D, Brandt F, Fischer F et al. (2013). The Complexity of Computing Minimal Unidirectional Covering Sets Theory of Computing Systems.
  • Fischer F, Procaccia AD, Samorodnitsky A (2011). A New Perspective on Implementation by Voting Trees Random Structures and Algorithms.
  • Brandt F, Fischer F, Holzer M (2011). Equilibria of Graphical Games with Symmetries Theoretical Computer Science.
  • Brandt F, Brill M, Fischer F et al. (2011). On The Complexity of Iterated Weak Dominance in Constant-Sum Games Theory of Computing Systems.
  • Alon N, Fischer F, Procaccia AD et al. (2011). Sum of Us: Strategyproof Selection from the Selectors proc13thtark.
  • Brandt F, Brill M, Fischer F et al. (2011). The Computational Complexity of Weak Saddles Theory of Computing Systems.
  • Brandt F, Fischer F, Harrenstein P et al. (2010). A Computational Analysis of the Tournament Equilibrium Set Social Choice and Welfare.
  • Dekel O, Fischer F, Procaccia AD (2010). Incentive Compatible Regression Learning Journal of Computer and System Sciences.
  • Brandt F, Fischer F, Holzer M (2010). On Iterated Dominance, Matrix Elimination, and Matched Paths proc27thstacs.
  • Brandt F, Fischer F, Harrenstein P et al. (2009). Ranking Games Artificial Intelligence.
  • Brandt F, Fischer F, Holzer M (2009). Symmetries and the Complexity of Pure Nash Equilibrium Journal of Computer and System Sciences.
  • Brandt F, Fischer F, Harrenstein P (2009). The Computational Complexity of Choice Sets Mathematical Logic Quarterly.
  • Brandt F, Fischer F (2008). Computing the Minimal Covering Set Mathematical Social Sciences.
  • Fischer F, Holzer M, Katzenbeisser S (2006). The Influence of Neighbourhood and Choice on the Complexity of Finding Pure Nash Equilibria Information Processing Letters.