menu

School of Mathematical Sciences

People menu

Dr Felix Fischer

Felix

Lecturer in Optimisation/Operations Research

Email: felix.fischer@qmul.ac.uk
Telephone: +44 (0)20 7882 2607
Room Number: Queens’ Building W411
Website: http://www.maths.qmul.ac.uk/~ffischer
Office Hours: Please email for an appointment

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

  • Bjelde A, Fischer F, Klimm M (2017). Impartial Selection and the Power of Up to Two Choices. nameOfConference
  • Fischer F, Hudry O, Niedermeier R (2016). Weighted Tournament Solutions. nameOfConference
  • Ashlagi I, Fischer F, Kash IA et al. (2015). Mix and Match: A Strategyproof Mechanism for Multi-Hospital Kidney Exchange. nameOfConference
  • Fischer F, Klimm M (2015). Optimal Impartial Selection. nameOfConference
  • Dütting P, Fischer F, Jirapinyo P et al. (2015). Payment Rules through Discriminant-Based Classifiers. nameOfConference
  • Aziz H, Brill M, Fischer F et al. (2015). Possible and Necessary Winners of Partial Tournaments. nameOfConference
  • Brandt F, Brill M, Fischer F et al. (2014). Minimal Retentive Sets in Tournaments. nameOfConference
  • Brandt F, Fischer F, Harrenstein P (2013). On the Rate of Convergence of Fictitious Play. nameOfConference
  • Baumeister D, Brandt F, Fischer F et al. (2013). The Complexity of Computing Minimal Unidirectional Covering Sets. nameOfConference
  • Fischer F, Procaccia AD, Samorodnitsky A (2011). A New Perspective on Implementation by Voting Trees. nameOfConference
  • Brandt F, Fischer F, Holzer M (2011). Equilibria of Graphical Games with Symmetries. nameOfConference
  • Brandt F, Brill M, Fischer F et al. (2011). On The Complexity of Iterated Weak Dominance in Constant-Sum Games. nameOfConference
  • Alon N, Fischer F, Procaccia AD et al. (2011). Sum of Us: Strategyproof Selection from the Selectors. nameOfConference
  • Brandt F, Brill M, Fischer F et al. (2011). The Computational Complexity of Weak Saddles. nameOfConference
  • Brandt F, Fischer F, Harrenstein P et al. (2010). A Computational Analysis of the Tournament Equilibrium Set. nameOfConference
  • Dekel O, Fischer F, Procaccia AD (2010). Incentive Compatible Regression Learning. nameOfConference
  • Brandt F, Fischer F, Holzer M (2010). On Iterated Dominance, Matrix Elimination, and Matched Paths. nameOfConference
  • Brandt F, Fischer F, Harrenstein P et al. (2009). Ranking Games. nameOfConference
  • Brandt F, Fischer F, Holzer M (2009). Symmetries and the Complexity of Pure Nash Equilibrium. nameOfConference
  • Brandt F, Fischer F, Harrenstein P (2009). The Computational Complexity of Choice Sets. nameOfConference
  • Brandt F, Fischer F (2008). Computing the Minimal Covering Set. nameOfConference
  • Fischer F, Holzer M, Katzenbeisser S (2006). The Influence of Neighbourhood and Choice on the Complexity of Finding Pure Nash Equilibria. nameOfConference
Return to top