John Fearnley
Identifiers
- name variant John Fearnley 0.60 · backfill
Papers (26)
- Constant Inapproximability for Fisher Markets cs.GT · 2026 · author #2
- Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD cs.GT · 2026 · author #2
- Unique End of Potential Line cs.CC · 2018 · author #1
- An Improved Envy-Free Cake Cutting Protocol for Four Agents cs.GT · 2018 · author #3
- Market Making via Reinforcement Learning cs.AI · 2018 · author #2
- End of Potential Line cs.CC · 2018 · author #1
- Efficient Parallel Strategy Improvement for Parity Games cs.DS · 2017 · author #1
- Computing Constrained Approximate Equilibria in Polymatrix Games cs.GT · 2017 · author #2
- An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space cs.LO · 2017 · author #1
- CLS: New Problems and Completeness cs.CC · 2017 · author #1
- Inapproximability Results for Approximate Nash Equilibria cs.GT · 2016 · author #2
- Hiring Secretaries over Time: The Benefit of Concurrent Employment cs.DS · 2016 · author #2
- An Empirical Study on Computing Equilibria in Polymatrix Games cs.GT · 2016 · author #2
- Distributed Methods for Computing Approximate Equilibria cs.GT · 2015 · author #4
- Lipschitz Continuity and Approximate Equilibria cs.GT · 2015 · author #2
- An Empirical Study of Finding Approximate Equilibria in Bimatrix Games cs.GT · 2015 · author #1
- Computing Approximate Nash Equilibria in Polymatrix Games cs.GT · 2014 · author #2
- The Complexity of the Simplex Method cs.DS · 2014 · author #1
- Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries cs.GT · 2013 · author #1
- Learning Equilibria of Games via Payoff Queries cs.GT · 2013 · author #1
- Approximate Well-supported Nash Equilibria below Two-thirds cs.GT · 2012 · author #1
- Bounded Satisfiability for PCTL cs.LO · 2012 · author #2
- Synthesis of Succinct Systems cs.FL · 2012 · author #1
- Efficient Approximation of Optimal Control for Markov Games cs.GT · 2010 · author #1
- Exponential Lower Bounds For Policy Iteration cs.DS · 2010 · author #1
- Non-oblivious Strategy Improvement cs.GT · 2010 · author #1
Mentions
- 1509.02023 #2 · backfill · confidence 0.70 John Fearnley
- 1011.0397 #1 · arxiv_oai · confidence 0.70 John Fearnley
- 1502.04980 #1 · backfill · confidence 0.70 John Fearnley
- 1409.3741 #2 · backfill · confidence 0.70 John Fearnley
- 1404.0605 #1 · backfill · confidence 0.70 John Fearnley
- 1310.7419 #1 · backfill · confidence 0.70 John Fearnley
- 1302.3116 #1 · backfill · confidence 0.70 John Fearnley
- 1204.0707 #1 · backfill · confidence 0.70 John Fearnley
- 1204.0469 #2 · backfill · confidence 0.70 John Fearnley
- 1202.5449 #1 · backfill · confidence 0.70 John Fearnley
- 1011.0397 #1 · backfill · confidence 0.70 John Fearnley
- 1003.3418 #1 · backfill · confidence 0.70 John Fearnley
- 1003.2976 #1 · backfill · confidence 0.70 John Fearnley
Frequent Coauthors
- Rahul Savani 14 shared papers
- Argyrios Deligkas 8 shared papers
- Sven Schewe 4 shared papers
- Ruta Mehta 3 shared papers
- Spencer Gordon 3 shared papers
- Alexandros Hollender 2 shared papers
- Martin Gairing 2 shared papers
- Paul Spirakis 2 shared papers
- Themistoklis Melissourgos 2 shared papers
- Tobenna Peter Igwe 2 shared papers
- Alexander Skopalik 1 shared papers
- Andreas Koukorinis 1 shared papers
- Andreas T\"onnis 1 shared papers
- Artur Czumaj 1 shared papers
- Christos-Alexandros Psomas 1 shared papers
- Daniel Schmand 1 shared papers
- Dominik Wojtczak 1 shared papers
- Doron Peled 1 shared papers
- Eftychia Vakaliou 1 shared papers
- Evangelos Markakis 1 shared papers