Hierarchical Reinforcement Learning in Communication-Mediated Multiagent Coordination. - Felix A. Fischer; Michael Rovatsos; Gerhard Weiß 001 (AAMAS, 2004)

Reasoning About Communication - A Practical Approach Based on Empirical Semantics. - Felix A. Fischer; Michael Rovatsos (CIA, 2004)

Operational Modelling of Agent Autonomy: Theoretical Aspects and a Formal Language. - Gerhard Weiß 001; Felix A. Fischer; Matthias Nickles; Michael Rovatsos (AOSE, 2005)

Practical Strategic Reasoning and Adaptation in Rational Argument-Based Negotiation. - Michael Rovatsos; Iyad Rahwan; Felix A. Fischer; Gerhard Weiß 001 (ArgMAS, 2005)

Acquiring and adapting probabilistic models of agent conversation. - Felix A. Fischer; Michael Rovatsos; Gerhard Weiß 001 (AAMAS, 2005)

An integrated framework for adaptive reasoning about conversation patterns. - Michael Rovatsos; Felix A. Fischer; Gerhard Weiß 001 (AAMAS, 2005)

Communication Attitudes: A Formal Account of Ostensible Beliefs and Intentions. - Matthias Nickles; Felix A. Fischer (EUMAS, 2005)

An empirical semantics approach to reasoning about communication. - Felix A. Fischer; Michael Rovatsos (Eng. Appl. Artif. Intell., 2005)

Communication Attitudes: A Formal Approach to Ostensible Intentions, and Individual and Group Opinions. - Matthias Nickles; Felix A. Fischer; Gerhard Weiß 001 (LCMAS, 2005)

On Strictly Competitive Multi-Player Games. - Felix Brandt 001; Felix A. Fischer; Yoav Shoham (AAAI, 2006)

Adaptiveness in Agent Communication: Application and Adaptation of Conversation Patterns. - Felix A. Fischer; Michael Rovatsos; Gerhard Weiß 001 (AC, 2006)

Computational Opinions. - Felix A. Fischer; Matthias Nickles (ECAI, 2006)

The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. - Felix A. Fischer; Markus Holzer 001; Stefan Katzenbeisser 001 (Inf. Process. Lett., 2006)

Computational Aspects of Covering in Dominance Graphs. - Felix Brandt 001; Felix A. Fischer (AAAI, 2007)

Commitment and extortion. - Paul Harrenstein; Felix Brandt 001; Felix A. Fischer (AAMAS, 2007)

A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios. - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein; Yoav Shoham (IJCAI, 2007)

PageRank as a Weak Tournament Solution. - Felix Brandt 001; Felix A. Fischer (WINE, 2007)

Recognizing Members of the Tournament Equilibrium Set is NP-hard - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein (CoRR, 2007)

The Empirical Semantics Approach to Communication Structure Learning and Usage: Individualistic Vs. Systemic Views. - Matthias Nickles; Michael Rovatsos; Marco Schmitt 002; Wilfried Brauer; Felix A. Fischer; Thomas Malsch; Kai Paetow; Gerhard Weiß 001 (J. Artif. Soc. Soc. Simul., 2007)

Specifying the intertwining of cooperation and autonomy in agent-based systems. - Gerhard Weiß 001; Matthias Nickles; Michael Rovatsos; Felix A. Fischer (J. Netw. Comput. Appl., 2007)

On the Hardness and Existence of Quasi-Strict Equilibria. - Felix Brandt 001; Felix A. Fischer (SAGT, 2008)

On Iterated Dominance, Matrix Elimination, and Matched Paths. - Felix Brandt 001; Felix A. Fischer; Markus Holzer 001 (Electron. Colloquium Comput. Complex., 2008)

Computing the minimal covering set. - Felix Brandt 001; Felix A. Fischer (Math. Soc. Sci., 2008)

Computational aspects of Shapley's saddles. - Felix Brandt 001; Markus Brill; Felix A. Fischer; Paul Harrenstein (AAMAS (1), 2009)

Ranking games. - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein; Yoav Shoham (Artif. Intell., 2009)

Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP - Dorothea Baumeister; Felix Brandt 001; Felix A. Fischer; Jörg Rothe (CoRR, 2009)

Symmetries and the complexity of pure Nash equilibrium. - Felix Brandt 001; Felix A. Fischer; Markus Holzer 001 (J. Comput. Syst. Sci., 2009)

The Computational Complexity of Choice Sets. - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein (Math. Log. Q., 2009)

Computing Shapley's saddles. - Felix Brandt 001; Markus Brill; Felix A. Fischer; Paul Harrenstein; Jan Hoffmann 002 (SIGecom Exch., 2009)

Mix and match. - Itai Ashlagi; Felix A. Fischer; Ian A. Kash; Ariel D. Procaccia (EC, 2010)

Incentive compatible regression learning. - Ofer Dekel; Felix A. Fischer; Ariel D. Procaccia (J. Comput. Syst. Sci., 2010)

A computational analysis of the tournament equilibrium set. - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein; Maximilian Mair (Soc. Choice Welf., 2010)

Simplicity-expressiveness tradeoffs in mechanism design. - Paul Dütting; Felix A. Fischer; David C. Parkes (EC, 2011)

Sum of us: strategyproof selection from the selectors. - Noga Alon; Felix A. Fischer; Ariel D. Procaccia; Moshe Tennenholtz (TARK, 2011)

The Computational Complexity of Weak Saddles. - Felix Brandt 001; Markus Brill; Felix A. Fischer; Jan Hoffmann 002 (Theory Comput. Syst., 2011)

On the Complexity of Iterated Weak Dominance in Constant-Sum Games. - Felix Brandt 001; Markus Brill; Felix A. Fischer; Paul Harrenstein (Theory Comput. Syst., 2011)

A new perspective on implementation by voting trees. - Felix A. Fischer; Ariel D. Procaccia; Alex Samorodnitsky (Random Struct. Algorithms, 2011)

Equilibria of graphical games with symmetries. - Felix Brandt 001; Felix A. Fischer; Markus Holzer 001 (Theor. Comput. Sci., 2011)

The Price of Neutrality for the Ranked Pairs Method. - Markus Brill; Felix A. Fischer (AAAI, 2012)

The Complexity of Computing Minimal Unidirectional Covering Sets. - Dorothea Baumeister; Felix Brandt 001; Felix A. Fischer; Jan Hoffmann 002; Jörg Rothe (Theory Comput. Syst., 2013)

On the Rate of Convergence of Fictitious Play. - Felix Brandt 001; Felix A. Fischer; Paul Harrenstein (Theory Comput. Syst., 2013)

Minimal retentive sets in tournaments. - Felix Brandt 001; Markus Brill; Felix A. Fischer; Paul Harrenstein (Soc. Choice Welf., 2014)

Mix and match: A strategyproof mechanism for multi-hospital kidney exchange. - Itai Ashlagi; Felix A. Fischer; Ian A. Kash; Ariel D. Procaccia (Games Econ. Behav., 2015)

Possible and Necessary Winners of Partial Tournaments. - Haris Aziz 001; Markus Brill; Felix A. Fischer; Paul Harrenstein; Jérôme Lang; Hans Georg Seedig (J. Artif. Intell. Res., 2015)

Optimal Impartial Selection. - Felix A. Fischer; Max Klimm (SIAM J. Comput., 2015)

Payment Rules through Discriminant-Based Classifiers. - Paul Dütting; Felix A. Fischer; Pichayut Jirapinyo; John K. Lai; Benjamin Lubin; David C. Parkes (ACM Trans. Economics and Comput., 2015)

Truthful Outcomes from Non-Truthful Position Auctions. - Paul Dütting; Felix A. Fischer; David C. Parkes (EC, 2016)

Revenue Gaps for Discriminatory and Anonymous Sequential Posted Pricing. - Paul Dütting; Felix A. Fischer; Max Klimm (CoRR, 2016)

Weighted Tournament Solutions. - Felix A. Fischer; Olivier Hudry; Rolf Niedermeier (Handbook of Computational Social Choice, 2016)

Impartial Selection and the Power of Up to Two Choices. - Antje Bjelde; Felix A. Fischer; Max Klimm (ACM Trans. Economics and Comput., 2017)

Prophet Inequalities for Independent Random Variables from an Unknown Distribution. - José R. Correa; Paul Dütting; Felix A. Fischer; Kevin Schewior (CoRR, 2018)

Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution. - José Correa 001; Paul Dütting; Felix A. Fischer; Kevin Schewior (EC, 2019)

Expressiveness and Robustness of First-Price Position Auctions. - Paul Dütting; Felix A. Fischer; David C. Parkes (Math. Oper. Res., 2019)

On index policies for stochastic minsum scheduling. - Franziska Eberle; Felix A. Fischer; Jannik Matuschke; Nicole Megow (Oper. Res. Lett., 2019)

Streaming Algorithms for Online Selection Problems. - José Correa 001; Paul Dütting; Felix A. Fischer; Kevin Schewior; Bruno Ziliotto (CoRR, 2020)

Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract). - José Correa 001; Paul Dütting; Felix A. Fischer; Kevin Schewior; Bruno Ziliotto (ITCS, 2021)

Optimal Impartial Correspondences. - Javier Cembrano; Felix A. Fischer; Max Klimm (WINE, 2022)

Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution. - José Correa 001; Paul Dütting; Felix A. Fischer; Kevin Schewior (Math. Oper. Res., 2022)

Improved Bounds for Single-Nomination Impartial Selection. - Javier Cembrano; Felix A. Fischer; Max Klimm (EC, 2023)

Impartial Rank Aggregation. - Javier Cembrano; Felix A. Fischer; Max Klimm (CoRR, 2023)

Impartial selection with additive guarantees via iterated deletion. - Javier Cembrano; Felix A. Fischer; David Hannon; Max Klimm (Games Econ. Behav., 2024)

Nontruthful Position Auctions Are More Robust to Misspecification. - Paul Dütting; Felix A. Fischer; David C. Parkes (Math. Oper. Res., 2024)