Dr Felix FischerSenior Lecturer in Optimisation and Operations ResearchEmail: felix.fischer@qmul.ac.ukTelephone: +44 (0)20 7882 2607Room Number: Mathematical Sciences Building, Room: MB-G23Website: http://www.maths.qmul.ac.uk/~ffischerProfilePublicationsProfile Felix Fischer is a Senior Lecturer in Optimisation and Operations Research in the School of Mathematical Sciences at Queen Mary University of London. He uses models and techniques from game theory, mechanism design, optimisation, and applied probability to study systems in which strategic behavior of individuals leads to good overall outcomes. ResearchPublications Cembrano J, Fischer F, Klimm M (2022). Optimal Impartial Correspondences journal 18th Conference on Web and Internet Economics. doi https://qmro.qmul.ac.uk/xmlui/handle/123456789/82362 Cembrano J, Fischer F, Hannon D et al. (2022). Impartial Selection with Additive Guarantees via Iterated Deletion journal Proceedings of the 23rd ACM Conference on Economics and Computation. 10.1145/3490486.3538294 https://qmro.qmul.ac.uk/xmlui/handle/123456789/79124 Correa J, Dütting P, Fischer F et al. (2021). Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution Mathematics of Operations Research nameOfConference. 10.1287/moor.2021.1167 https://qmro.qmul.ac.uk/xmlui/handle/123456789/82364 Correa J, Dütting P, Fischer F et al. (2020). Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility journal 12th Innovations in Theoretical Computer Science Conference. doi https://qmro.qmul.ac.uk/xmlui/handle/123456789/69232 Correa J, Dütting P, Fischer F et al. (2019). Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution journal Proceedings of the 2019 ACM Conference on Economics and Computation. 10.1145/3328526.3329627 https://qmro.qmul.ac.uk/xmlui/handle/123456789/57808 Eberle F, Fischer F, Matuschke J et al. (2019). On index policies for stochastic minsum scheduling Operations Research Letters nameOfConference. 10.1016/j.orl.2019.03.007 https://qmro.qmul.ac.uk/xmlui/handle/123456789/42327 Eberle F, FISCHER F, Matuschke J et al. (2019). On Index Policies for Stochastic Minsum Scheduling Operations Research Letters nameOfConference. 10.1016/j.orl.2019.03.007 https://qmro.qmul.ac.uk/xmlui/handle/123456789/56832 Dütting P, FISCHER FA, Parkes DC (2018). Expressiveness And Robustness of First-Price Position Auctions Mathematics of Operations Research nameOfConference. 10.1287/moor.2017.0920 https://qmro.qmul.ac.uk/xmlui/handle/123456789/29112 Bjelde A, Fischer F, Klimm M (2017). Impartial Selection and the Power of Up to Two Choices ACM Transactions on Economics and Computation nameOfConference. 10.1145/3107922 https://qmro.qmul.ac.uk/xmlui/handle/123456789/28869 Fischer F, Hudry O, Niedermeier R (2016). Weighted Tournament Solutions journal nameOfConference. doi qmroHref Fischer F, Klimm M (2015). Optimal Impartial Selection SIAM Journal on Computing nameOfConference. 10.1137/140995775 qmroHref Ashlagi I, Fischer F, Kash IA et al. (2015). Mix and Match: A Strategyproof Mechanism for Multi-Hospital Kidney Exchange Games and Economic Behavior nameOfConference. 10.1016/j.geb.2013.05.008 qmroHref Dütting P, Fischer F, Jirapinyo P et al. (2015). Payment Rules through Discriminant-Based Classifiers ACM Transactions on Economics and Computation nameOfConference. doi https://qmro.qmul.ac.uk/xmlui/handle/123456789/36404 Aziz H, Brill M, Fischer F et al. (2015). Possible and Necessary Winners of Partial Tournaments Journal of Artificial Intelligence Research nameOfConference. doi qmroHref Brandt F, Brill M, Fischer F et al. (2014). Minimal Retentive Sets in Tournaments Social Choice and Welfare nameOfConference. doi qmroHref Brandt F, Fischer F, Harrenstein P (2013). On the Rate of Convergence of Fictitious Play Theory of Computing Systems nameOfConference. doi qmroHref Baumeister D, Brandt F, Fischer F et al. (2013). The Complexity of Computing Minimal Unidirectional Covering Sets Theory of Computing Systems nameOfConference. doi qmroHref Fischer F, Procaccia AD, Samorodnitsky A (2011). A New Perspective on Implementation by Voting Trees Random Structures and Algorithms nameOfConference. doi qmroHref Brandt F, Fischer F, Holzer M (2011). Equilibria of Graphical Games with Symmetries Theoretical Computer Science nameOfConference. doi qmroHref Brandt F, Brill M, Fischer F et al. (2011). On The Complexity of Iterated Weak Dominance in Constant-Sum Games Theory of Computing Systems nameOfConference. doi qmroHref Alon N, Fischer F, Procaccia AD et al. (2011). Sum of Us: Strategyproof Selection from the Selectors proc13thtark nameOfConference. doi qmroHref Brandt F, Brill M, Fischer F et al. (2011). The Computational Complexity of Weak Saddles Theory of Computing Systems nameOfConference. doi qmroHref Brandt F, Fischer F, Harrenstein P et al. (2010). A Computational Analysis of the Tournament Equilibrium Set Social Choice and Welfare nameOfConference. doi qmroHref Dekel O, Fischer F, Procaccia AD (2010). Incentive Compatible Regression Learning Journal of Computer and System Sciences nameOfConference. doi qmroHref Brandt F, Fischer F, Holzer M (2010). On Iterated Dominance, Matrix Elimination, and Matched Paths proc27thstacs nameOfConference. doi qmroHref Brandt F, Fischer F, Harrenstein P et al. (2009). Ranking Games Artificial Intelligence nameOfConference. doi qmroHref Brandt F, Fischer F, Holzer M (2009). Symmetries and the Complexity of Pure Nash Equilibrium Journal of Computer and System Sciences nameOfConference. doi qmroHref Brandt F, Fischer F, Harrenstein P (2009). The Computational Complexity of Choice Sets Mathematical Logic Quarterly nameOfConference. doi qmroHref Brandt F, Fischer F (2008). Computing the Minimal Covering Set Mathematical Social Sciences nameOfConference. doi qmroHref Fischer F, Holzer M, Katzenbeisser S (2006). The Influence of Neighbourhood and Choice on the Complexity of Finding Pure Nash Equilibria Information Processing Letters nameOfConference. doi qmroHref