John Fearnley
- Computing Approximate Nash Equilibria in Polymatrix Games
2014/09/12 by Argyrios Deligkas, Deligkas, Argyrios, John Fearnley +5 · 3 citations
Decision Sciences · Economics, Econometrics and Finance · #Computer Science and Game Theory (cs.GT) #Economic theories and models #FOS: Computer and information sciences #Game Theory and Applications #Game Theory and Voting Systems
- Bounded Satisfiability for PCTL
2012/03/30 by Nathalie Bertrand, Bertrand, Nathalie, John Fearnley +3 · 1 citation
Computer Science · #Formal Methods in Verification #Petri Nets in System Modeling #Advanced Software Engineering Methodologies
- Constant Inapproximability for PPA
2022/01/24 by Argyrios Deligkas, John Fearnley, Deligkas, Argyrios +5 · 1 citation
Computer Science · Economics, Econometrics and Finance · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Voting Systems
- Pure-Circuit: Tight Inapproximability for PPAD
2024/07/15 by Argyrios Deligkas, John Fearnley, Alexandros Hollender +1 · 2 citations
Engineering · Computer Science · #Advancements in Semiconductor Devices and Circuit Design #Quantum Computing Algorithms and Architecture #Low-power high-performance VLSI design
- The Complexity of Computing KKT Solutions of Quadratic Programs
2023/11/22 by John Fearnley, Paul W. Goldberg, Fearnley, John +5 · 1 citation
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Polynomial and algebraic computation