Skip to main content
Research
  1. Queen Mary University of London
  2. Research
  3. Publications

Publications: DR Felix Fischer

Back to Search
Cembrano J, Fischer F, Klimm M ( 2026 ) . Optimal impartial correspondences . Social Choice and Welfare vol. 66 , ( 4 ) 1059 - 1081 .
Cembrano J, Fischer F, Klimm M ( 2026 ) . Improved Bounds for Single-Nomination Impartial Selection . Mathematics of Operations Research . vol. 51 , 1486 - 1513 .
Cembrano J, Fischer F, Klimm M ( 2025 ) . Impartial Selection with Predictions . Conference: The 39th Annual Conference on Neural Information Processing Systems
( 2024 ) . Surveys in Combinatorics 2024 . Cambridge University Press
Cembrano J, Fischer F, Hannon D, Klimm M ( 2024 ) . Impartial selection with additive guarantees via iterated deletion . Games and Economic Behavior vol. 144 , 203 - 224 .
Dütting P, Fischer F, Parkes DC ( 2024 ) . Nontruthful Position Auctions Are More Robust to Misspecification . Mathematics of Operations Research vol. 49 , ( 2 ) 901 - 927 .
Cembrano J, Fischer F, Klimm M ( 2022 ) . Optimal Impartial Correspondences . Lecture Notes in Computer Science . vol. 13778 , 187 - 203 .
Cembrano J, Fischer F, Hannon D, Klimm M ( 2022 ) . Impartial Selection with Additive Guarantees via Iterated Deletion . Conference: Proceedings of the 23rd ACM Conference on Economics and Computation1104 - 1105 .
Correa J, Dütting P, Fischer F, Schewior K ( 2022 ) . Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution . Mathematics of Operations Research vol. 47 , ( 2 ) 1287 - 1309 .
Correa J, Dütting P, Fischer F, Schewior K ( 2021 ) . Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution . Mathematics of Operations Research vol. 47 , ( 2 )
Correa J, Dütting P, Fischer F, Schewior K, Ziliotto B ( 2020 ) . Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility . Conference: 12th Innovations in Theoretical Computer Science Conference
Correa J, Dütting P, Fischer F, Schewior K ( 2019 ) . Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution . Conference: Proceedings of the 2019 ACM Conference on Economics and Computation3 - 17 .
Eberle F, Fischer F, Matuschke J, Megow N ( 2019 ) . On index policies for stochastic minsum scheduling . Operations Research Letters . vol. 47 , 213 - 218 .
Eberle F, FISCHER F, Matuschke J, Megow N ( 2019 ) . On Index Policies for Stochastic Minsum Scheduling . Operations Research Letters
Dütting P, Fischer F, 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 vol. 5 , ( 4 ) 1 - 20 .
Fischer F, Hudry O, Niedermeier R ( 2016 ) . Weighted Tournament Solutions . Handbook of Computational Social Choice , Cambridge University Press (CUP)
Bjelde A, Fischer F, Klimm M ( 2015 ) . Impartial Selection and the Power of up to Two Choices . Lecture Notes in Computer Science . vol. 9470 , 146 - 158 .
Aziz H, Brill M, Fischer F, Harrenstein P, Lang J, Seedig HG ( 2015 ) . Possible and Necessary Winners of Partial Tournaments . Journal of Artificial Intelligence Research vol. 54 , 493 - 534 .
Fischer F, Klimm M ( 2015 ) . Optimal Impartial Selection . SIAM Journal on Computing vol. 44 , ( 5 ) 1263 - 1285 .
Ashlagi I, Fischer F, Kash IA, Procaccia AD ( 2015 ) . Mix and match: A strategyproof mechanism for multi-hospital kidney exchange . Games and Economic Behavior vol. 91 , 284 - 296 .
Dütting P, Fischer F, Jirapinyo P, Lai JK, Lubin B, Parkes DC ( 2015 ) . Payment Rules through Discriminant-Based Classifiers . ACM Transactions on Economics and Computation vol. 3 , ( 1 ) 1 - 41 .
Dütting P, Fischer F, Parkes DC ( 2014 ) . Expressiveness and robustness of first-price position auctions . Conference: Proceedings of the fifteenth ACM conference on Economics and computation57 - 74 .
Fischer F, Klimm M ( 2014 ) . Optimal impartial selection . Conference: Proceedings of the fifteenth ACM conference on Economics and computation803 - 820 .
Brandt F, Brill M, Fischer F, Harrenstein P ( 2013 ) . Minimal retentive sets in tournaments . Social Choice and Welfare vol. 42 , ( 3 ) 551 - 574 .
Brandt F, Fischer F, Harrenstein P ( 2013 ) . On the Rate of Convergence of Fictitious Play . Theory of Computing Systems vol. 53 , ( 1 ) 41 - 52 .
Baumeister D, Brandt F, Fischer F, Hoffmann J, Rothe J ( 2012 ) . The Complexity of Computing Minimal Unidirectional Covering Sets . Theory of Computing Systems vol. 53 , ( 3 ) 467 - 502 .
Brill M, Fischer F ( 2012 ) . The price of neutrality for the ranked pairs method . Proceedings of the National Conference on Artificial Intelligence . vol. 2 , 1299 - 1305 .
Dütting P, Fischer F, Jirapinyo P, Lai JK, Lubin B, Parkes DC ( 2012 ) . Payment rules through discriminant-based classifiers . Conference: Proceedings of the 13th ACM Conference on Electronic Commerce477 - 494 .
Aziz H, Brill M, Fischer F, Harrenstein P, Lang J, Seedig HG ( 2012 ) . Possible and necessary winners of partial tournaments . 11th International Conference on Autonomous Agents and Multiagent Systems 2012 Aamas 2012 Innovative Applications Track . vol. 1 , 136 - 143 .
Brill M, Fischer F ( 2012 ) . The Price of Neutrality for the Ranked Pairs Method . Proceedings of the 26th Aaai Conference on Artificial Intelligence Aaai 2012 . 1299 - 1305 .
Alon N, Fischer F, Procaccia A, Tennenholtz M ( 2011 ) . Sum of us . Conference: Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge101 - 110 .
Fischer F, Procaccia AD, Samorodnitsky A ( 2011 ) . A new perspective on implementation by voting trees . Random Structures and Algorithms vol. 39 , ( 1 ) 59 - 82 .
Dütting P, Fischer F, Parkes DC ( 2011 ) . Simplicity-expressiveness tradeoffs in mechanism design . Conference: Proceedings of the 12th ACM conference on Electronic commerce341 - 350 .
Brandt F, Fischer F, Holzer M ( 2011 ) . Equilibria of graphical games with symmetries . Theoretical Computer Science vol. 412 , ( 8-10 ) 675 - 685 .
Dekel O, Fischer F, Procaccia AD ( 2010 ) . Incentive compatible regression learning . Journal of Computer and System Sciences vol. 76 , ( 8 ) 759 - 777 .
Brandt F, Brill M, Fischer F, Hoffmann J ( 2010 ) . The Computational Complexity of Weak Saddles . Theory of Computing Systems vol. 49 , ( 1 ) 139 - 161 .
Brandt F, Brill M, Fischer F, Harrenstein P ( 2010 ) . On the Complexity of Iterated Weak Dominance in Constant-Sum Games . Theory of Computing Systems vol. 49 , ( 1 ) 162 - 181 .
Ashlagi I, Fischer F, Kash I, Procaccia AD ( 2010 ) . Mix and match . Conference: Proceedings of the 11th ACM conference on Electronic commerce305 - 314 .
Brandt F, Brill M, Fischer F, Harrenstein P ( 2010 ) . Minimal retentive sets in tournaments . Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems Aamas . vol. 1 , 47 - 54 .
Brandt F, Fischer F, Holzer M ( 2010 ) . On Iterated Dominance, Matrix Elimination, and Matched Paths . proc27thstacs . 107 - 118 .
Brandt F, Fischer F, Harrenstein P ( 2010 ) . On the Rate of Convergence of Fictitious Play . Lecture Notes in Computer Science . vol. 6386 , 102 - 113 .
Baumeister D, Brandt F, Fischer F, Hoffmann J, Rothe J ( 2010 ) . The Complexity of Computing Minimal Unidirectional Covering Sets . Lecture Notes in Computer Science . vol. 6078 , 299 - 310 .
Brandt F, Fischer F, Harrenstein P, Mair M ( 2009 ) . A computational analysis of the tournament equilibrium set . Social Choice and Welfare vol. 34 , ( 4 ) 597 - 609 .
Brandt F, Fischer F, Harrenstein P ( 2009 ) . The Computational Complexity of Choice Sets . Mathematical Logic Quarterly vol. 55 , ( 4 ) 444 - 459 .
Fischer F, Procaccia AD, Samorodnitsky A ( 2009 ) . A new perspective on implementation by voting trees . Conference: Proceedings of the 10th ACM conference on Electronic commerce31 - 40 .
Brandt F, Fischer F, Holzer M ( 2009 ) . Symmetries and the complexity of pure Nash equilibrium . Journal of Computer and System Sciences vol. 75 , ( 3 ) 163 - 177 .
Brandt F, Fischer F, Harrenstein P, Shoham Y ( 2009 ) . Ranking games . Artificial Intelligence vol. 173 , ( 2 ) 221 - 239 .
Brandt F, Brill M, Fischer F, Harrenstein P ( 2009 ) . Computational aspects of shapley's saddles . Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems Aamas . vol. 1 , 181 - 188 .
Brandt F, Brill M, Fischer F, Harrenstein P ( 2009 ) . On the Complexity of Iterated Weak Dominance in Constant-Sum Games . Lecture Notes in Computer Science . vol. 5814 , 287 - 298 .
Brandt F, Brill M, Fischer F, Hoffmann J ( 2009 ) . The Computational Complexity of Weak Saddles . Lecture Notes in Computer Science . vol. 5814 , 238 - 249 .
Brandt F, Fischer F, Harrenstein P, Mair M ( 2008 ) . A computational analysis of the tournament equilibrium set . Proceedings of the National Conference on Artificial Intelligence . vol. 1 , 38 - 43 .
Dekel O, Fischer F, Procaccia AD ( 2008 ) . Incentive compatible regression learning . Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms . 884 - 893 .
Brandt F, Fischer F ( 2008 ) . Computing the minimal covering set . Mathematical Social Sciences vol. 56 , ( 2 ) 254 - 268 .
Brandt F, Fischer F, Holzer M ( 2008 ) . Equilibria of Graphical Games with Symmetries . Lecture Notes in Computer Science . vol. 5385 , 198 - 209 .
Brandt F, Fischer F ( 2008 ) . On the Hardness and Existence of Quasi-Strict Equilibria . Lecture Notes in Computer Science . vol. 4997 , 291 - 302 .
Brandt F, Fischer F, Harrenstein P, Shoham Y ( 2007 ) . A game-theoretic analysis of strictly competitive multiagent scenarios . Ijcai International Joint Conference on Artificial Intelligence . 1199 - 1206 .
Brandt F, Fischer F ( 2007 ) . Computational aspects of covering in dominance graphs . Proceedings of the National Conference on Artificial Intelligence . vol. 1 , 694 - 699 .
Weiß G, Nickles M, Rovatsos M, Fischer F ( 2007 ) . Specifying the intertwining of cooperation and autonomy in agent-based systems . Journal of Network and Computer Applications vol. 30 , ( 3 ) 1196 - 1215 .
Harrenstein P, Brandt F, Fischer F ( 2007 ) . Commitment and extortion . Conference: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems1 - 8 .
Brandt F, Fischer F ( 2007 ) . PageRank as a Weak Tournament Solution . Lecture Notes in Computer Science . vol. 4858 , 300 - 305 .
Brandt F, Fischer F, Holzer M ( 2007 ) . Symmetries and the Complexity of Pure Nash Equilibrium . Lecture Notes in Computer Science . vol. 4393 , 212 - 223 .
Brandt F, Fischer F, Harrenstein P ( 2007 ) . The computational complexity of choice sets . Conference: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge - TARK '0782 - 91 .
Brandt F, Fischer F, Shoham Y ( 2006 ) . On strictly competitive multi-player games . Proceedings of the National Conference on Artificial Intelligence . vol. 1 , 605 - 612 .
Fischer F, Holzer M, Katzenbeisser S ( 2006 ) . The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria . Information Processing Letters vol. 99 , ( 6 ) 239 - 245 .
Cembrano J, Fischer F, Klimm M . Improved Bounds for Single-Nomination Impartial Selection . Mathematics of Operations Research
Back to Search