Felix A. Fischer

Orcid: 0000-0002-8403-9273

Affiliations:
  • Queen Mary University of London, UK
  • University of Cambridge (former)
  • LMU Munich (former)


According to our database1, Felix A. Fischer authored at least 61 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Impartial Rank Aggregation.
CoRR, 2023

Improved Bounds for Single-Nomination Impartial Selection.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution.
Math. Oper. Res., 2022

Optimal Impartial Correspondences.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Impartial Selection with Additive Guarantees via Iterated Deletion.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021
Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract).
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Streaming Algorithms for Online Selection Problems.
CoRR, 2020

2019
On index policies for stochastic minsum scheduling.
Oper. Res. Lett., 2019

Expressiveness and Robustness of First-Price Position Auctions.
Math. Oper. Res., 2019

Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Prophet Inequalities for Independent Random Variables from an Unknown Distribution.
CoRR, 2018

2017
Impartial Selection and the Power of Up to Two Choices.
ACM Trans. Economics and Comput., 2017

2016
Weighted Tournament Solutions.
Proceedings of the Handbook of Computational Social Choice, 2016

Revenue Gaps for Discriminatory and Anonymous Sequential Posted Pricing.
CoRR, 2016

Truthful Outcomes from Non-Truthful Position Auctions.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015
Payment Rules through Discriminant-Based Classifiers.
ACM Trans. Economics and Comput., 2015

Optimal Impartial Selection.
SIAM J. Comput., 2015

Possible and Necessary Winners of Partial Tournaments.
J. Artif. Intell. Res., 2015

Mix and match: A strategyproof mechanism for multi-hospital kidney exchange.
Games Econ. Behav., 2015

2014
Minimal retentive sets in tournaments.
Soc. Choice Welf., 2014

2013
On the Rate of Convergence of Fictitious Play.
Theory Comput. Syst., 2013

The Complexity of Computing Minimal Unidirectional Covering Sets.
Theory Comput. Syst., 2013

2012
The Price of Neutrality for the Ranked Pairs Method.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Equilibria of graphical games with symmetries.
Theor. Comput. Sci., 2011

A new perspective on implementation by voting trees.
Random Struct. Algorithms, 2011

On the Complexity of Iterated Weak Dominance in Constant-Sum Games.
Theory Comput. Syst., 2011

The Computational Complexity of Weak Saddles.
Theory Comput. Syst., 2011

Sum of us: strategyproof selection from the selectors.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Simplicity-expressiveness tradeoffs in mechanism design.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010
A computational analysis of the tournament equilibrium set.
Soc. Choice Welf., 2010

Incentive compatible regression learning.
J. Comput. Syst. Sci., 2010

Mix and match.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

2009
Computing Shapley's saddles.
SIGecom Exch., 2009

The Computational Complexity of Choice Sets.
Math. Log. Q., 2009

Symmetries and the complexity of pure Nash equilibrium.
J. Comput. Syst. Sci., 2009

Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP
CoRR, 2009

Ranking games.
Artif. Intell., 2009

Computational aspects of Shapley's saddles.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
Computing the minimal covering set.
Math. Soc. Sci., 2008

On Iterated Dominance, Matrix Elimination, and Matched Paths.
Electron. Colloquium Comput. Complex., 2008

On the Hardness and Existence of Quasi-Strict Equilibria.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007
Specifying the intertwining of cooperation and autonomy in agent-based systems.
J. Netw. Comput. Appl., 2007

The Empirical Semantics Approach to Communication Structure Learning and Usage: Individualistic Vs. Systemic Views.
J. Artif. Soc. Soc. Simul., 2007

Recognizing Members of the Tournament Equilibrium Set is NP-hard
CoRR, 2007

PageRank as a Weak Tournament Solution.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios.
Proceedings of the IJCAI 2007, 2007

Commitment and extortion.
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

Computational Aspects of Covering in Dominance Graphs.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria.
Inf. Process. Lett., 2006

Computational Opinions.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Adaptiveness in Agent Communication: Application and Adaptation of Conversation Patterns.
Proceedings of the Agent Communication II, International Workshops on Agent Communication, 2006

On Strictly Competitive Multi-Player Games.
Proceedings of the Proceedings, 2006

2005
Communication Attitudes: A Formal Approach to Ostensible Intentions, and Individual and Group Opinions.
Proceedings of the Third International Workshop on Logic and Communication in Multi-Agent Systems, 2005

An empirical semantics approach to reasoning about communication.
Eng. Appl. Artif. Intell., 2005

Communication Attitudes: A Formal Account of Ostensible Beliefs and Intentions.
Proceedings of the EUMAS 2005, 2005

An integrated framework for adaptive reasoning about conversation patterns.
Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), 2005

Acquiring and adapting probabilistic models of agent conversation.
Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), 2005

Practical Strategic Reasoning and Adaptation in Rational Argument-Based Negotiation.
Proceedings of the Argumentation in Multi-Agent Systems, Second International Workshop, 2005

Operational Modelling of Agent Autonomy: Theoretical Aspects and a Formal Language.
Proceedings of the Agent-Oriented Software Engineering VI, 6th International Workshop, 2005

2004
Reasoning About Communication - A Practical Approach Based on Empirical Semantics.
Proceedings of the Cooperative Information Agents VIII, 8th International Workshop, 2004

Hierarchical Reinforcement Learning in Communication-Mediated Multiagent Coordination.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004


  Loading...