Browse by People

Up a level
Export as [feed] RSS [feed] RSS 2.0 Short Author List
Number of items: 6.

Fearnley, J and Savani, R ORCID: 0000-0003-1262-7831
(2016) The Complexity of All-Switches Strategy Improvement. In: ACM-SIAM Symposium on Discrete Algorithms (SODA-16).

Fearnley, J, Rabe, MN, Schewe, S ORCID: 0000-0002-9093-9518 and Zhang, L
(2016) Efficient approximation of optimal control for continuous-time Markov games. INFORMATION AND COMPUTATION, 247. pp. 106-129.

Fearnley, J and Savani, R ORCID: 0000-0003-1262-7831
(2016) Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries. ACM Transactions on Economics and Computation (TEAC), 4 (4). pp. 1-19.

Fearnley, J and Jurdzinski, M
(2015) Reachability in Two-Clock Timed Automata is PSPACE-complete. Information and Computation, 243. pp. 26-36.

Fearnley, J, Gairing, M, Mnich, M and Savani, AR
(2021) Reachability switching games. Logical Methods in Computer Science, 17 (2). 10:1-10:29-.

Deligkas, A, Fearnley, J, Hollender, A and Melissourgos, T
(2023) Tight Inapproximability for Graphical Games. In: AAAI 2023.

This list was generated on Tue Sep 12 11:19:34 2023 BST.