default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Fearnley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c40]Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani
, Patrick Schnider, Simon Weber:
Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. ICALP 2024: 32:1-32:18- [c39]John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani:
The Complexity of Computing KKT Solutions of Quadratic Programs. STOC 2024: 892-903 - [i39]Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber:
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents. CoRR abs/2402.07683 (2024) - 2023
- [j21]John Fearnley, Paul Goldberg, Alexandros Hollender, Rahul Savani:
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. J. ACM 70(1): 7:1-7:74 (2023) - [c38]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Tight Inapproximability for Graphical Games. AAAI 2023: 5600-5607 - [i38]Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra:
Games on Graphs. CoRR abs/2305.10546 (2023) - [i37]John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani:
The Complexity of Computing KKT Solutions of Quadratic Programs. CoRR abs/2311.13738 (2023) - 2022
- [j20]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the existential theory of the reals. J. Comput. Syst. Sci. 125: 106-128 (2022) - [j19]John Fearnley, Dömötör Pálvölgyi, Rahul Savani:
A Faster Algorithm for Finding Tarski Fixed Points. ACM Trans. Algorithms 18(3): 23:1-23:23 (2022) - [c37]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos:
Pizza Sharing Is PPA-Hard. AAAI 2022: 4957-4965 - [c36]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Pure-Circuit: Strong Inapproximability for PPAD. FOCS 2022: 159-170 - [c35]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Constant inapproximability for PPA. STOC 2022: 1010-1023 - [i36]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Constant Inapproximability for PPA. CoRR abs/2201.10011 (2022) - [i35]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Pure-Circuit: Strong Inapproximability for PPAD. CoRR abs/2209.15149 (2022) - [i34]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Tight Inapproximability for Graphical Games. CoRR abs/2209.15151 (2022) - 2021
- [j18]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. J. Comput. Syst. Sci. 117: 75-98 (2021) - [j17]John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
Reachability Switching Games. Log. Methods Comput. Sci. 17(2) (2021) - [c34]John Fearnley, Rahul Savani:
A Faster Algorithm for Finding Tarski Fixed Points. STACS 2021: 29:1-29:16 - [c33]John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani:
The complexity of gradient descent: CLS = PPAD ∩ PLS. STOC 2021: 46-59 - 2020
- [j16]Argyrios Deligkas, John Fearnley, Paul G. Spirakis:
Lipschitz Continuity and Approximate Equilibria. Algorithmica 82(10): 2927-2954 (2020) - [j15]John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani:
Unique end of potential line. J. Comput. Syst. Sci. 114: 1-35 (2020) - [j14]Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis:
Hiring Secretaries over Time: The Benefit of Concurrent Employment. Math. Oper. Res. 45(1): 323-352 (2020) - [c32]Argyrios Deligkas, John Fearnley, Rahul Savani:
Tree Polymatrix Games Are PPAD-Hard. ICALP 2020: 38:1-38:14 - [c31]John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani:
One-Clock Priced Timed Games are PSPACE-hard. LICS 2020: 397-409 - [i33]John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani:
One-Clock Priced Timed Games are PSPACE-hard. CoRR abs/2001.04458 (2020) - [i32]Argyrios Deligkas, John Fearnley, Rahul Savani:
Tree Polymatrix Games are PPAD-hard. CoRR abs/2002.12119 (2020) - [i31]John Fearnley, Rahul Savani:
A faster algorithm for finding Tarski fixed points. CoRR abs/2010.02618 (2020) - [i30]John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani:
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. CoRR abs/2011.01929 (2020) - [i29]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos:
Square-Cut Pizza Sharing is PPA-complete. CoRR abs/2012.14236 (2020)
2010 – 2019
- 2019
- [j13]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. Algorithmica 81(3): 1205-1231 (2019) - [j12]John Fearnley, Sanjay Jain, Bart de Keijzer, Sven Schewe, Frank Stephan, Dominik Wojtczak:
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space. Int. J. Softw. Tools Technol. Transf. 21(3): 325-349 (2019) - [c30]John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani:
Unique End of Potential Line. ICALP 2019: 56:1-56:15 - [c29]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. ICALP 2019: 138:1-138:14 - [i28]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. CoRR abs/1903.03101 (2019) - 2018
- [j11]Argyrios Deligkas, John Fearnley, Rahul Savani:
Inapproximability results for constrained approximate Nash equilibria. Inf. Comput. 262: 40-56 (2018) - [j10]John Fearnley, Rahul Savani:
The Complexity of All-switches Strategy Improvement. Log. Methods Comput. Sci. 14(4) (2018) - [c28]Thomas Spooner, John Fearnley, Rahul Savani, Andreas Koukorinis:
Market Making via Reinforcement Learning. AAMAS 2018: 434-442 - [c27]John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
Reachability Switching Games. ICALP 2018: 124:1-124:14 - [c26]Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou:
An Improved Envy-Free Cake Cutting Protocol for Four Agents. SAGT 2018: 87-99 - [c25]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the Existential Theory of the Reals. WINE 2018: 126-139 - [i27]John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani:
End of Potential Line. CoRR abs/1804.03450 (2018) - [i26]Thomas Spooner, John Fearnley, Rahul Savani, Andreas Koukorinis:
Market Making via Reinforcement Learning. CoRR abs/1804.04216 (2018) - [i25]Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou:
An Improved Envy-Free Cake Cutting Protocol for Four Agents. CoRR abs/1807.00317 (2018) - [i24]Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis:
Approximating the Existential Theory of the Reals. CoRR abs/1810.01393 (2018) - [i23]John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani:
Unique End of Potential Line. CoRR abs/1811.03841 (2018) - 2017
- [j9]Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis:
Computing Approximate Nash Equilibria in Polymatrix Games. Algorithmica 77(2): 487-514 (2017) - [c24]John Fearnley:
Efficient Parallel Strategy Improvement for Parity Games. CAV (2) 2017: 137-154 - [c23]Argyrios Deligkas, John Fearnley, Rahul Savani:
Computing Constrained Approximate Equilibria in Polymatrix Games. SAGT 2017: 93-105 - [c22]John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan, Dominik Wojtczak:
An ordered approach to solving parity games in quasi polynomial time and quasi linear space. SPIN 2017: 112-121 - [i22]John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani:
CLS: New Problems and Completeness. CoRR abs/1702.06017 (2017) - [i21]John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan, Dominik Wojtczak:
An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space. CoRR abs/1703.01296 (2017) - [i20]Argyrios Deligkas, John Fearnley, Rahul Savani:
Computing Constrained Approximate Equilibria in Polymatrix Games. CoRR abs/1705.02266 (2017) - [i19]John Fearnley:
Efficient Parallel Strategy Improvement for Parity Games. CoRR abs/1705.02313 (2017) - [i18]John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
Reachability Switching Games. CoRR abs/1709.08991 (2017) - 2016
- [j8]John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen:
Approximate Well-supported Nash Equilibria Below Two-thirds. Algorithmica 76(2): 297-319 (2016) - [j7]John Fearnley, Markus N. Rabe, Sven Schewe, Lijun Zhang:
Efficient approximation of optimal control for continuous-time Markov games. Inf. Comput. 247: 106-129 (2016) - [j6]John Fearnley, Rahul Savani:
Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries. ACM Trans. Economics and Comput. 4(4): 25:1-25:19 (2016) - [c21]Argyrios Deligkas, John Fearnley, Tobenna Peter Igwe, Rahul Savani:
An Empirical Study on Computing Equilibria in Polymatrix Games. AAMAS 2016: 186-195 - [c20]Argyrios Deligkas, John Fearnley, Paul G. Spirakis:
Lipschitz Continuity and Approximate Equilibria. SAGT 2016: 15-26 - [c19]John Fearnley, Rahul Savani:
The Complexity of All-switches Strategy Improvement. SODA 2016: 130-139 - [c18]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. WINE 2016: 15-28 - [c17]Argyrios Deligkas, John Fearnley, Rahul Savani:
Inapproximability Results for Approximate Nash Equilibria. WINE 2016: 29-43 - [i17]Argyrios Deligkas, John Fearnley, Tobenna Peter Igwe, Rahul Savani:
An Empirical Study on Computing Equilibria in Polymatrix Games. CoRR abs/1602.06865 (2016) - [i16]Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis:
Hiring Secretaries over Time: The Benefit of Concurrent Employment. CoRR abs/1604.08125 (2016) - [i15]Argyrios Deligkas, John Fearnley, Rahul Savani:
Inapproximability Results for Approximate Nash Equilibria. CoRR abs/1608.03574 (2016) - 2015
- [j5]John Fearnley, Marcin Jurdzinski:
Reachability in two-clock timed automata is PSPACE-complete. Inf. Comput. 243: 26-36 (2015) - [j4]John Fearnley, Doron A. Peled, Sven Schewe:
Synthesis of succinct systems. J. Comput. Syst. Sci. 81(7): 1171-1193 (2015) - [j3]John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani:
Learning equilibria of games via payoff queries. J. Mach. Learn. Res. 16: 1305-1344 (2015) - [c16]John Fearnley, Rahul Savani:
The Complexity of the Simplex Method. STOC 2015: 201-208 - [c15]John Fearnley, Tobenna Peter Igwe, Rahul Savani:
An Empirical Study of Finding Approximate Equilibria in Bimatrix Games. SEA 2015: 339-351 - [i14]John Fearnley, Tobenna Peter Igwe, Rahul Savani:
An Empirical Study of Finding Approximate Equilibria in Bimatrix Games. CoRR abs/1502.04980 (2015) - [i13]John Fearnley, Rahul Savani:
The Complexity of All-switches Strategy Improvement. CoRR abs/1507.04500 (2015) - [i12]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. CoRR abs/1512.03315 (2015) - 2014
- [c14]John Fearnley, Rahul Savani:
Finding approximate Nash equilibria of bimatrix games via payoff queries. EC 2014: 657-674 - [c13]Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis:
Computing Approximate Nash Equilibria in Polymatrix Games. WINE 2014: 58-71 - [i11]John Fearnley, Rahul Savani:
The Complexity of the Simplex Method. CoRR abs/1404.0605 (2014) - [i10]Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis:
Computing Approximate Nash Equilibria in Polymatrix Games. CoRR abs/1409.3741 (2014) - 2013
- [j2]John Fearnley, Sven Schewe:
Time and Space Results for Parity Games with Bounded Treewidth. Log. Methods Comput. Sci. 9(2) (2013) - [c12]John Fearnley, Marcin Jurdzinski:
Reachability in Two-Clock Timed Automata Is PSPACE-Complete. ICALP (2) 2013: 212-223 - [c11]John Fearnley, Martin Gairing, Paul Goldberg, Rahul Savani:
Learning equilibria of games via payoff queries. EC 2013: 397-414 - [i9]John Fearnley, Marcin Jurdzinski:
Reachability in Two-Clock Timed Automata is PSPACE-complete. CoRR abs/1302.3109 (2013) - [i8]John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani:
Learning Equilibria of Games via Payoff Queries. CoRR abs/1302.3116 (2013) - [i7]John Fearnley, Rahul Savani:
Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries. CoRR abs/1310.7419 (2013) - 2012
- [j1]John Fearnley, Martin Zimmermann:
Playing Muller Games in a Hurry. Int. J. Found. Comput. Sci. 23(3): 649-668 (2012) - [c10]John Fearnley, Doron A. Peled, Sven Schewe:
Synthesis of Succinct Systems. ATVA 2012: 208-222 - [c9]Nathalie Bertrand, John Fearnley, Sven Schewe:
Bounded Satisfiability for PCTL. CSL 2012: 92-106 - [c8]John Fearnley, Sven Schewe:
Time and Parallelizability Results for Parity Games with Bounded Treewidth. ICALP (2) 2012: 189-200 - [c7]John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen:
Approximate Well-Supported Nash Equilibria Below Two-Thirds. SAGT 2012: 108-119 - [i6]John Fearnley, Doron A. Peled, Sven Schewe:
Synthesis of Succinct Systems. CoRR abs/1202.5449 (2012) - [i5]Nathalie Bertrand, John Fearnley, Sven Schewe:
Bounded Satisfiability for PCTL. CoRR abs/1204.0469 (2012) - [i4]John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen:
Approximate Well-supported Nash Equilibria below Two-thirds. CoRR abs/1204.0707 (2012) - 2011
- [c6]John Fearnley, Markus N. Rabe, Sven Schewe, Lijun Zhang:
Efficient Approximation of Optimal Control for Continuous-Time Markov Games. FSTTCS 2011: 399-410 - [c5]John Fearnley, Oded Lachish:
Parity Games on Graphs with Medium Tree-Width. MFCS 2011: 303-314 - 2010
- [b1]John Fearnley:
Strategy iteration algorithms for games and Markov decision processes. University of Warwick, Coventry, UK, 2010 - [c4]John Fearnley:
Exponential Lower Bounds for Policy Iteration. ICALP (2) 2010: 551-562 - [c3]John Fearnley:
Non-oblivious Strategy Improvement. LPAR (Dakar) 2010: 212-230 - [c2]John Fearnley, Marcin Jurdzinski, Rahul Savani:
Linear Complementarity Algorithms for Infinite Games. SOFSEM 2010: 382-393 - [c1]John Fearnley, Martin Zimmermann:
Playing Muller Games in a Hurry. GANDALF 2010: 146-161 - [i3]John Fearnley:
Non-oblivious Strategy Improvement. CoRR abs/1003.2976 (2010) - [i2]John Fearnley:
Exponential Lower Bounds For Policy Iteration. CoRR abs/1003.3418 (2010)
2000 – 2009
- 2009
- [i1]John Fearnley, Marcin Jurdzinski, Rahul Savani:
Linear Complementarity Algorithms for Infinite Games. CoRR abs/0909.5653 (2009)
Coauthor Index
[c40] [c39] [i39] [j21] [i37] [j19] [j17] [c34] [c33] [j15] [c32] [c31] [i33] [i32] [i31] [i30] [j13] [c30] [j11] [j10] [c28] [c27] [i27] [i26] [i23] [j9] [c23] [i22] [i20] [i18] [j8] [j6] [c21] [c19] [c18] [c17] [i17] [i15] [j3] [c16] [c15] [i14] [i13] [i12] [c14] [c13] [i11] [i10] [c11] [i8] [i7] [c7] [i4] [c2] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
