default search action
Felix A. Fischer
Person information
- affiliation: Queen Mary University of London, UK
- affiliation (former): University of Cambridge
- affiliation (former): LMU Munich
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j28]Javier Cembrano
, Felix A. Fischer, David Hannon
Impartial selection with additive guarantees via iterated deletion. Games Econ. Behav. 144: 203-224 (2024) - [j27]Paul Dütting
Nontruthful Position Auctions Are More Robust to Misspecification. Math. Oper. Res. 49(2): 901-927 (2024) - 2023
- [c44]Javier Cembrano
Improved Bounds for Single-Nomination Impartial Selection. EC 2023: 449 - [i21]Javier Cembrano, Felix A. Fischer, Max Klimm:
Optimal Impartial Correspondences. CoRR abs/2301.04544 (2023) - [i20]Javier Cembrano, Felix A. Fischer, Max Klimm:
Improved Bounds for Single-Nomination Impartial Selection. CoRR abs/2305.09998 (2023) - [i19]Javier Cembrano, Felix A. Fischer, Max Klimm:
Impartial Rank Aggregation. CoRR abs/2310.13141 (2023) - 2022
- [j26]José Correa
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution. Math. Oper. Res. 47(2): 1287-1309 (2022) - [c43]Javier Cembrano, Felix A. Fischer, David Hannon
Impartial Selection with Additive Guarantees via Iterated Deletion. EC 2022: 1104-1105 - [c42]Javier Cembrano, Felix A. Fischer, Max Klimm:
Optimal Impartial Correspondences. WINE 2022: 187-203 - [i18]Javier Cembrano, Felix A. Fischer, David Hannon, Max Klimm:
Impartial Selection with Additive Guarantees via Iterated Deletion. CoRR abs/2205.08979 (2022) - 2021
- [c41]José Correa, Paul Dütting, Felix A. Fischer
Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract). ITCS 2021: 86:1-86:1 - 2020
- [i17]José Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior, Bruno Ziliotto:
Streaming Algorithms for Online Selection Problems. CoRR abs/2007.06110 (2020)
2010 – 2019
- 2019
- [j25]Paul Dütting
Expressiveness and Robustness of First-Price Position Auctions. Math. Oper. Res. 44(1): 196-211 (2019) - [j24]Franziska Eberle, Felix A. Fischer, Jannik Matuschke
On index policies for stochastic minsum scheduling. Oper. Res. Lett. 47(3): 213-218 (2019) - [c40]José Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior
Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution. EC 2019: 3-17 - 2018
- [i16]José R. Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior:
Prophet Inequalities for Independent Random Variables from an Unknown Distribution. CoRR abs/1811.06114 (2018) - 2017
- [j23]Antje Bjelde
Impartial Selection and the Power of Up to Two Choices. ACM Trans. Economics and Comput. 5(4): 21:1-21:20 (2017) - 2016
- [c39]Paul Dütting, Felix A. Fischer, David C. Parkes:
Truthful Outcomes from Non-Truthful Position Auctions. EC 2016: 813 - [r1]Felix A. Fischer, Olivier Hudry, Rolf Niedermeier:
Weighted Tournament Solutions. Handbook of Computational Social Choice 2016: 85-102 - [i15]Paul Dütting, Felix A. Fischer, David C. Parkes:
Truthful Outcomes from Non-Truthful Position Auctions. CoRR abs/1602.07593 (2016) - [i14]Paul Dütting, Felix A. Fischer, Max Klimm:
Revenue Gaps for Discriminatory and Anonymous Sequential Posted Pricing. CoRR abs/1607.07105 (2016) - 2015
- [j22]Itai Ashlagi, Felix A. Fischer, Ian A. Kash, Ariel D. Procaccia:
Mix and match: A strategyproof mechanism for multi-hospital kidney exchange. Games Econ. Behav. 91: 284-296 (2015) - [j21]Haris Aziz
Possible and Necessary Winners of Partial Tournaments. J. Artif. Intell. Res. 54: 493-534 (2015) - [j20]Felix A. Fischer, Max Klimm:
Optimal Impartial Selection. SIAM J. Comput. 44(5): 1263-1285 (2015) - [j19]Paul Dütting, Felix A. Fischer, Pichayut Jirapinyo, John K. Lai, Benjamin Lubin, David C. Parkes:
Payment Rules through Discriminant-Based Classifiers. ACM Trans. Economics and Comput. 3(1): 5:1-5:41 (2015) - [c38]Antje Bjelde
Impartial Selection and the Power of up to Two Choices. WINE 2015: 146-158 - 2014
- [j18]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Minimal retentive sets in tournaments. Soc. Choice Welf. 42(3): 551-574 (2014) - [c37]Paul Dütting, Felix A. Fischer, David C. Parkes:
Expressiveness and robustness of first-price position auctions. EC 2014: 57-74 - [c36]Felix A. Fischer, Max Klimm:
Optimal impartial selection. EC 2014: 803-820 - 2013
- [j17]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
On the Rate of Convergence of Fictitious Play. Theory Comput. Syst. 53(1): 41-52 (2013) - [j16]Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe:
The Complexity of Computing Minimal Unidirectional Covering Sets. Theory Comput. Syst. 53(3): 467-502 (2013) - [i13]Paul Dütting, Felix A. Fischer, David C. Parkes:
Expressiveness and Robustness of First-Price Position Auctions. CoRR abs/1307.5216 (2013) - [i12]Felix A. Fischer, Max Klimm:
Optimal Impartial Selection. CoRR abs/1310.8631 (2013) - 2012
- [c35]Markus Brill, Felix A. Fischer:
The Price of Neutrality for the Ranked Pairs Method. AAAI 2012: 1299-1305 - [c34]Haris Aziz
Possible and necessary winners of partial tournaments. AAMAS 2012: 585-592 - [c33]Paul Dütting, Felix A. Fischer, Pichayut Jirapinyo, John K. Lai, Benjamin Lubin, David C. Parkes:
Payment rules through discriminant-based classifiers. EC 2012: 477-494 - [i11]Paul Dütting, Felix A. Fischer, Pichayut Jirapinyo, John K. Lai, Benjamin Lubin, David C. Parkes:
Payment Rules through Discriminant-Based Classifiers. CoRR abs/1208.1184 (2012) - 2011
- [j15]Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann:
The Computational Complexity of Weak Saddles. Theory Comput. Syst. 49(1): 139-161 (2011) - [j14]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
On the Complexity of Iterated Weak Dominance in Constant-Sum Games. Theory Comput. Syst. 49(1): 162-181 (2011) - [j13]Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky:
A new perspective on implementation by voting trees. Random Struct. Algorithms 39(1): 59-82 (2011) - [j12]Felix Brandt, Felix A. Fischer, Markus Holzer
Equilibria of graphical games with symmetries. Theor. Comput. Sci. 412(8-10): 675-685 (2011) - [c32]Paul Dütting, Felix A. Fischer, David C. Parkes:
Simplicity-expressiveness tradeoffs in mechanism design. EC 2011: 341-350 - [c31]Noga Alon, Felix A. Fischer, Ariel D. Procaccia, Moshe Tennenholtz:
Sum of us: strategyproof selection from the selectors. TARK 2011: 101-110 - [i10]Paul Dütting, Felix A. Fischer, David C. Parkes:
Simplicity-Expressiveness Tradeoffs in Mechanism Design. CoRR abs/1102.3632 (2011) - 2010
- [j11]Ofer Dekel, Felix A. Fischer, Ariel D. Procaccia:
Incentive compatible regression learning. J. Comput. Syst. Sci. 76(8): 759-777 (2010) - [j10]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair:
A computational analysis of the tournament equilibrium set. Soc. Choice Welf. 34(4): 597-609 (2010) - [c30]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Minimal retentive sets in tournaments. AAMAS 2010: 47-58 - [c29]Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe:
The Complexity of Computing Minimal Unidirectional Covering Sets. CIAC 2010: 299-310 - [c28]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
On the Rate of Convergence of Fictitious Play. SAGT 2010: 102-113 - [c27]Itai Ashlagi, Felix A. Fischer, Ian A. Kash, Ariel D. Procaccia:
Mix and match. EC 2010: 305-314 - [c26]Felix Brandt, Felix A. Fischer, Markus Holzer
On Iterated Dominance, Matrix Elimination, and Matched Paths. STACS 2010: 107-118 - [i9]Felix Brandt, Felix A. Fischer, Markus Holzer:
On Iterated Dominance, Matrix Elimination, and Matched Paths. CoRR abs/1001.0529 (2010) - [i8]Itai Ashlagi, Felix A. Fischer, Ian A. Kash, Ariel D. Procaccia:
Mix and Match. CoRR abs/1006.1881 (2010)
2000 – 2009
- 2009
- [j9]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham:
Ranking games. Artif. Intell. 173(2): 221-239 (2009) - [j8]Felix Brandt, Felix A. Fischer, Markus Holzer
Symmetries and the complexity of pure Nash equilibrium. J. Comput. Syst. Sci. 75(3): 163-177 (2009) - [j7]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
The Computational Complexity of Choice Sets. Math. Log. Q. 55(4): 444-459 (2009) - [j6]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jan Hoffmann:
Computing Shapley's saddles. SIGecom Exch. 8(2): 3 (2009) - [c25]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Computational aspects of Shapley's saddles. AAMAS (1) 2009: 209-216 - [c24]Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann:
The Computational Complexity of Weak Saddles. SAGT 2009: 238-249 - [c23]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
On the Complexity of Iterated Weak Dominance in Constant-Sum Games. SAGT 2009: 287-298 - [c22]Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky:
A new perspective on implementation by voting trees. EC 2009: 31-40 - [i7]Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jörg Rothe:
Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP. CoRR abs/0901.3692 (2009) - [i6]Noga Alon, Felix A. Fischer, Ariel D. Procaccia, Moshe Tennenholtz:
Sum of Us: Strategyproof Selection from the Selectors. CoRR abs/0910.4699 (2009) - 2008
- [j5]Felix Brandt, Felix A. Fischer:
Computing the minimal covering set. Math. Soc. Sci. 56(2): 254-268 (2008) - [c21]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair:
A Computational Analysis of the Tournament Equilibrium Set. AAAI 2008: 38-43 - [c20]Felix Brandt, Felix A. Fischer:
On the Hardness and Existence of Quasi-Strict Equilibria. SAGT 2008: 291-302 - [c19]Ofer Dekel, Felix A. Fischer, Ariel D. Procaccia:
Incentive compatible regression learning. SODA 2008: 884-893 - [c18]Felix Brandt, Felix A. Fischer, Markus Holzer
Equilibria of Graphical Games with Symmetries. WINE 2008: 198-209 - [i5]Felix Brandt, Felix A. Fischer, Markus Holzer:
On Iterated Dominance, Matrix Elimination, and Matched Paths. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j4]Matthias Nickles, Michael Rovatsos, Marco Schmitt, Wilfried Brauer, Felix A. Fischer, Thomas Malsch, Kai Paetow, Gerhard Weiß:
The Empirical Semantics Approach to Communication Structure Learning and Usage: Individualistic Vs. Systemic Views. J. Artif. Soc. Soc. Simul. 10(1) (2007) - [j3]Gerhard Weiß, Matthias Nickles
Specifying the intertwining of cooperation and autonomy in agent-based systems. J. Netw. Comput. Appl. 30(3): 1196-1215 (2007) - [c17]Felix Brandt, Felix A. Fischer:
Computational Aspects of Covering in Dominance Graphs. AAAI 2007: 694-699 - [c16]Paul Harrenstein, Felix Brandt, Felix A. Fischer:
Commitment and extortion. AAMAS 2007: 26 - [c15]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham:
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios. IJCAI 2007: 1199-1206 - [c14]Felix Brandt, Felix A. Fischer, Markus Holzer
Symmetries and the Complexity of Pure Nash Equilibrium. STACS 2007: 212-223 - [c13]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
The computational complexity of choice sets. TARK 2007: 82-91 - [c12]Felix Brandt, Felix A. Fischer:
PageRank as a Weak Tournament Solution. WINE 2007: 300-305 - [i4]Ofer Dekel, Felix A. Fischer, Ariel D. Procaccia:
Incentive Compatible Regression Learning. Computational Social Systems and the Internet 2007 - [i3]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
Recognizing Members of the Tournament Equilibrium Set is NP-hard. CoRR abs/0711.2961 (2007) - [i2]Felix Brandt, Felix A. Fischer, Markus Holzer:
Equilibria of Graphical Games with Symmetries. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j2]Felix A. Fischer, Markus Holzer
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. Inf. Process. Lett. 99(6): 239-245 (2006) - [c11]Felix Brandt, Felix A. Fischer, Yoav Shoham:
On Strictly Competitive Multi-Player Games. AAAI 2006: 605-612 - [c10]Felix A. Fischer, Michael Rovatsos, Gerhard Weiß:
Adaptiveness in Agent Communication: Application and Adaptation of Conversation Patterns. AC 2006: 211-226 - [c9]Felix A. Fischer, Matthias Nickles:
Computational Opinions. ECAI 2006: 240-244 - [i1]Felix Brandt, Felix A. Fischer, Markus Holzer:
Symmetries and the Complexity of Pure Nash Equilibrium. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j1]Felix A. Fischer, Michael Rovatsos:
An empirical semantics approach to reasoning about communication. Eng. Appl. Artif. Intell. 18(7): 809-823 (2005) - [c8]Gerhard Weiß, Felix A. Fischer, Matthias Nickles, Michael Rovatsos:
Operational Modelling of Agent Autonomy: Theoretical Aspects and a Formal Language. AOSE 2005: 1-15 - [c7]Michael Rovatsos, Iyad Rahwan
Practical Strategic Reasoning and Adaptation in Rational Argument-Based Negotiation. ArgMAS 2005: 122-137 - [c6]Felix A. Fischer, Michael Rovatsos, Gerhard Weiß:
Acquiring and adapting probabilistic models of agent conversation. AAMAS 2005: 106-113 - [c5]Michael Rovatsos, Felix A. Fischer, Gerhard Weiß:
An integrated framework for adaptive reasoning about conversation patterns. AAMAS 2005: 1123-1124 - [c4]Matthias Nickles, Felix A. Fischer:
Communication Attitudes: A Formal Account of Ostensible Beliefs and Intentions. EUMAS 2005: 493-494 - [c3]Matthias Nickles
Communication Attitudes: A Formal Approach to Ostensible Intentions, and Individual and Group Opinions. LCMAS 2005: 95-115 - 2004
- [c2]Felix A. Fischer, Michael Rovatsos, Gerhard Weiß:
Hierarchical Reinforcement Learning in Communication-Mediated Multiagent Coordination. AAMAS 2004: 1334-1335 - [c1]Felix A. Fischer, Michael Rovatsos:
Reasoning About Communication - A Practical Approach Based on Empirical Semantics. CIA 2004: 107-122
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: