Felix Fischer

Available identifiers

zbMath Open fischer.felixMaRDI QIDQ372957

List of research outcomes

Publication	Date of Publication	Type
Nontruthful position auctions are more robust to misspecification	2024-06-27	Paper
Impartial selection with additive guarantees via iterated deletion	2024-04-30	Paper
Optimal impartial correspondences	2023-08-04	Paper
Prophet inequalities for independent and identically distributed random variables from an unknown distribution	2022-06-27	Paper
Weighted tournament solutions	2020-11-12	Paper
Expressiveness and robustness of first-price position auctions	2020-03-12	Paper
On index policies for stochastic minsum scheduling	2020-02-10	Paper
Impartial Selection and the Power of up to Two Choices	2016-01-08	Paper
Possible and necessary winners of partial tournaments	2016-01-07	Paper
Optimal impartial selection	2015-11-04	Paper
Mix and match: a strategyproof mechanism for multi-hospital kidney exchange	2015-06-08	Paper
Minimal retentive sets in tournaments	2014-12-15	Paper
On the rate of convergence of fictitious play	2013-10-21	Paper
The complexity of computing minimal unidirectional covering sets	2013-10-21	Paper
Communication attitudes: a formal approach to ostensible intentions, and individual and group opinions	2013-10-07	Paper
On iterated dominance, matrix elimination, and matched paths	2012-01-23	Paper
On the complexity of iterated weak dominance in constant-sum games	2011-11-23	Paper
The computational complexity of weak saddles	2011-11-23	Paper
A new perspective on implementation by voting trees	2011-08-09	Paper
Equilibria of graphical games with symmetries	2011-02-21	Paper
On the rate of convergence of fictitious play	2010-10-19	Paper
Incentive compatible regression learning	2010-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q3579413	2010-08-06	Paper
The complexity of computing minimal unidirectional covering sets	2010-05-28	Paper
A computational analysis of the tournament equilibrium set	2010-04-21	Paper
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria	2010-01-29	Paper
On the complexity of iterated weak dominance in constant-sum games	2009-12-01	Paper
The computational complexity of weak saddles	2009-12-01	Paper
Ranking games	2009-08-31	Paper
The Computational Complexity of Choice Sets	2009-08-14	Paper
Symmetries and the complexity of pure Nash equilibrium	2009-03-02	Paper
Computing the minimal covering set	2008-09-10	Paper
On the Hardness and Existence of Quasi-Strict Equilibria	2008-05-02	Paper
Symmetries and the Complexity of Pure Nash Equilibrium	2007-09-03	Paper

Research outcomes over time

This page was built for person: Felix Fischer