Publications: Dr Felix Fischer
Dütting P, Fischer F, Parkes DC
(
2024
)
.
Nontruthful Position Auctions Are More Robust to Misspecification
.
Mathematics of Operations Research
vol.
49
,
(
2
)
901
-
927
.
Cembrano J, Fischer F, Hannon D, Klimm M
(
2024
)
.
Impartial selection with additive guarantees via iterated deletion
.
Games and Economic Behavior
vol.
144
,
203
-
224
.
Cembrano J, Fischer F, Klimm M
(
2022
)
.
Optimal Impartial Correspondences
.
Conference:
18th Conference on Web and Internet Economics
Cembrano J, Fischer F, Hannon D, Klimm M
(
2022
)
.
Impartial Selection with Additive Guarantees via Iterated Deletion
.
Conference:
Proceedings of the 23rd ACM Conference on Economics and Computation1104
-
1105
.
Correa J, Dütting P, Fischer F, Schewior K
(
2021
)
.
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution
.
Mathematics of Operations Research
vol.
47
,
(
2
)
1287
-
1309
.
Correa J, Dütting P, Fischer F, Schewior K, Ziliotto B
(
2020
)
.
Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility
.
Conference:
12th Innovations in Theoretical Computer Science Conference
Correa J, Dütting P, Fischer F, Schewior K
(
2019
)
.
Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution
.
Conference:
Proceedings of the 2019 ACM Conference on Economics and Computation3
-
17
.
Eberle F, Fischer F, Matuschke J, Megow N
(
2019
)
.
On index policies for stochastic minsum scheduling
.
Operations Research Letters
.
vol.
47
,
213
-
218
.
Eberle F, FISCHER F, Matuschke J, Megow N
(
2019
)
.
On Index Policies for Stochastic Minsum Scheduling
.
Operations Research Letters
Dütting P, FISCHER FA, Parkes DC
(
2018
)
.
Expressiveness And Robustness of First-Price Position Auctions
.
Mathematics of Operations Research
Bjelde A, Fischer F, Klimm M
(
2017
)
.
Impartial Selection and the Power of Up to Two Choices
.
ACM Transactions on Economics and Computation
vol.
5
,
(
4
)
Article
21
,
Fischer F, Hudry O, Niedermeier R
(
2016
)
.
Weighted Tournament Solutions
.
Handbook of Computational Social Choice
,
Cambridge University Press
Fischer F, Klimm M
(
2015
)
.
Optimal Impartial Selection
.
SIAM Journal on Computing
vol.
44
,
(
5
)
Article
5
,
1263
-
1285
.
Ashlagi I, Fischer F, Kash IA, Procaccia AD
(
2015
)
.
Mix and Match: A Strategyproof Mechanism for Multi-Hospital Kidney Exchange
.
Games and Economic Behavior
vol.
91
,
284
-
296
.
Dütting P, Fischer F, Jirapinyo P, Lai J, Lubin B, Parkes DC
(
2015
)
.
Payment Rules through Discriminant-Based Classifiers
.
ACM Transactions on Economics and Computation
vol.
3
,
Article
1
,
5:1
-
5:41
.
Aziz H, Brill M, Fischer F, Harrenstein P, Lang J, Seedig HG
(
2015
)
.
Possible and Necessary Winners of Partial Tournaments
.
Journal of Artificial Intelligence Research
vol.
54
,
493
-
534
.
Brandt F, Brill M, Fischer F, Harrenstein P
(
2014
)
.
Minimal Retentive Sets in Tournaments
.
Social Choice and Welfare
vol.
42
,
Article
3
,
Brandt F, Fischer F, Harrenstein P
(
2013
)
.
On the Rate of Convergence of Fictitious Play
.
Theory of Computing Systems
vol.
53
,
Article
1
,
41
-
52
.
Baumeister D, Brandt F, Fischer F, Hoffmann J, Rothe J
(
2013
)
.
The Complexity of Computing Minimal Unidirectional Covering Sets
.
Theory of Computing Systems
vol.
53
,
Article
3
,
467
-
502
.
Fischer F, Procaccia AD, Samorodnitsky A
(
2011
)
.
A New Perspective on Implementation by Voting Trees
.
Random Structures and Algorithms
vol.
39
,
Article
1
,
59
-
82
.
Brandt F, Fischer F, Holzer M
(
2011
)
.
Equilibria of Graphical Games with Symmetries
.
Theoretical Computer Science
vol.
412
,
Article
8–10
,
675
-
685
.
Brandt F, Brill M, Fischer F, Harrenstein P
(
2011
)
.
On The Complexity of Iterated Weak Dominance in Constant-Sum Games
.
Theory of Computing Systems
vol.
49
,
Article
1
,
162
-
181
.
Alon N, Fischer F, Procaccia AD, Tennenholtz M
(
2011
)
.
Sum of Us: Strategyproof Selection from the Selectors
.
proc13thtark
.
101
-
110
.
Brandt F, Brill M, Fischer F, Hoffmann J
(
2011
)
.
The Computational Complexity of Weak Saddles
.
Theory of Computing Systems
vol.
49
,
Article
1
,
139
-
161
.
Brandt F, Fischer F, Harrenstein P, Mair M
(
2010
)
.
A Computational Analysis of the Tournament Equilibrium Set
.
Social Choice and Welfare
vol.
34
,
Article
4
,
597
-
609
.
Dekel O, Fischer F, Procaccia AD
(
2010
)
.
Incentive Compatible Regression Learning
.
Journal of Computer and System Sciences
vol.
76
,
Article
8
,
759
-
777
.
Brandt F, Fischer F, Holzer M
(
2010
)
.
On Iterated Dominance, Matrix Elimination, and Matched Paths
.
proc27thstacs
.
107
-
118
.
Brandt F, Fischer F, Harrenstein P, Shoham Y
(
2009
)
.
Ranking Games
.
Artificial Intelligence
vol.
173
,
Article
2
,
221
-
239
.
Brandt F, Fischer F, Holzer M
(
2009
)
.
Symmetries and the Complexity of Pure Nash Equilibrium
.
Journal of Computer and System Sciences
vol.
75
,
Article
3
,
163
-
177
.
Brandt F, Fischer F, Harrenstein P
(
2009
)
.
The Computational Complexity of Choice Sets
.
Mathematical Logic Quarterly
vol.
55
,
Article
4
,
444
-
459
.
Brandt F, Fischer F
(
2008
)
.
Computing the Minimal Covering Set
.
Mathematical Social Sciences
vol.
56
,
Article
2
,
254
-
268
.
Fischer F, Holzer M, Katzenbeisser S
(
2006
)
.
The Influence of Neighbourhood and Choice on the Complexity of Finding Pure Nash Equilibria
.
Information Processing Letters
vol.
99
,
Article
6
,
239
-
245
.