The following pages link to John Fearnley (Q259048):
Displaying 41 items.
- Efficient approximation of optimal control for continuous-time Markov games (Q259052) (← links)
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- Computing constrained approximate equilibria in polymatrix games (Q681849) (← links)
- An improved envy-free cake cutting protocol for four agents (Q1617649) (← links)
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- Lipschitz continuity and approximate equilibria (Q2006946) (← links)
- Efficient parallel strategy improvement for parity games (Q2164217) (← links)
- Unique end of potential line (Q2194856) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- Reachability in two-clock timed automata is PSPACE-complete (Q2347796) (← links)
- Synthesis of succinct systems (Q2353397) (← links)
- Lipschitz Continuity and Approximate Equilibria (Q2819444) (← links)
- PLAYING MULLER GAMES IN A HURRY (Q2909222) (← links)
- Efficient Approximation of Optimal Control for Markov Games (Q2911641) (← links)
- Computing Approximate Nash Equilibria in Polymatrix Games (Q2936976) (← links)
- The Complexity of the Simplex Method (Q2941508) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- Non-oblivious Strategy Improvement (Q3066101) (← links)
- Parity Games on Graphs with Medium Tree-Width (Q3088049) (← links)
- Time and Parallelizability Results for Parity Games with Bounded Treewidth (Q3167011) (← links)
- Linear Complementarity Algorithms for Infinite Games (Q3401105) (← links)
- Exponential Lower Bounds for Policy Iteration (Q3587467) (← links)
- (Q4553289) (← links)
- The Complexity of All-switches Strategy Improvement (Q4575585) (← links)
- Synthesis of Succinct Systems (Q4649297) (← links)
- Bounded Satisfiability for PCTL (Q4649540) (← links)
- Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width (Q4927428) (← links)
- (Q4989405) (← links)
- Reachability Switching Games (Q5002810) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- Hiring Secretaries over Time: The Benefit of Concurrent Employment (Q5108268) (← links)
- One-Clock Priced Timed Games are PSPACE-hard (Q5145650) (← links)
- (Q5151006) (← links)
- Reachability in Two-Clock Timed Automata Is PSPACE-Complete (Q5327435) (← links)
- (Q5744805) (← links)
- Approximating the existential theory of the reals (Q5918470) (← links)
- Approximating the existential theory of the reals (Q5918881) (← links)
