Felix Fischer

From MaRDI portal
Person:372957

Available identifiers

zbMath Open fischer.felixMaRDI QIDQ372957

List of research outcomes





PublicationDate of PublicationType
Nontruthful position auctions are more robust to misspecification2024-06-27Paper
Impartial selection with additive guarantees via iterated deletion2024-04-30Paper
Optimal impartial correspondences2023-08-04Paper
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution2022-06-27Paper
Weighted Tournament Solutions2020-11-12Paper
Expressiveness and Robustness of First-Price Position Auctions2020-03-12Paper
On index policies for stochastic minsum scheduling2020-02-10Paper
Impartial Selection and the Power of up to Two Choices2016-01-08Paper
Possible and Necessary Winners of Partial Tournaments2016-01-07Paper
Optimal Impartial Selection2015-11-04Paper
Mix and match: a strategyproof mechanism for multi-hospital kidney exchange2015-06-08Paper
Minimal retentive sets in tournaments2014-12-15Paper
The complexity of computing minimal unidirectional covering sets2013-10-21Paper
On the rate of convergence of fictitious play2013-10-21Paper
Communication attitudes: a formal approach to ostensible intentions, and individual and group opinions2013-10-07Paper
https://portal.mardi4nfdi.de/entity/Q31137412012-01-23Paper
On the complexity of iterated weak dominance in constant-sum games2011-11-23Paper
The computational complexity of weak saddles2011-11-23Paper
A new perspective on implementation by voting trees2011-08-09Paper
Equilibria of graphical games with symmetries2011-02-21Paper
On the Rate of Convergence of Fictitious Play2010-10-19Paper
Incentive compatible regression learning2010-10-07Paper
https://portal.mardi4nfdi.de/entity/Q35794132010-08-06Paper
The complexity of computing minimal unidirectional covering sets2010-05-28Paper
A computational analysis of the tournament equilibrium set2010-04-21Paper
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria2010-01-29Paper
On the Complexity of Iterated Weak Dominance in Constant-Sum Games2009-12-01Paper
The Computational Complexity of Weak Saddles2009-12-01Paper
Ranking games2009-08-31Paper
The Computational Complexity of Choice Sets2009-08-14Paper
Symmetries and the complexity of pure Nash equilibrium2009-03-02Paper
Computing the minimal covering set2008-09-10Paper
On the Hardness and Existence of Quasi-Strict Equilibria2008-05-02Paper
Symmetries and the Complexity of Pure Nash Equilibrium2007-09-03Paper

Research outcomes over time

This page was built for person: Felix Fischer