26 citations · 203 across the 41 of their papers we have counts for
53 papers
Super Unique Tarski is in UEOPL
John Fearnley, Rahul Savani
We define the Super-Unique-Tarski problem, which is a Tarski instance in which all slices are required to have a unique fixed point. We show that Super-Unique-Tarski lies in UEOPL…
Monotone Contractions
Eleni Batziou, John Fearnley, Spencer Gordon +2
We study functions that are both monotone and contracting, and we consider the problem of finding an -approximate fixed point of $f…
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
Michaela Borzechowski, John Fearnley, Spencer Gordon +3
We provide polynomial-time reductions between three search problems from three distinct areas: the P-matrix linear complementarity problem (P-LCP), finding the sink of a unique sin…
The Complexity of Computing KKT Solutions of Quadratic Programs
John Fearnley, Paul W. Goldberg, Alexandros Hollender +1
It is well known that solving a (non-convex) quadratic program is NP-hard. We show that the problem remains hard even if we are only looking for a Karush-Kuhn-Tucker (KKT) point, i…
Conditional Generators for Limit Order Book Environments: Explainability, Challenges, and Robustness
Andrea Coletta, Joseph Jerome, Rahul Savani +1
Limit order books are a fundamental and widespread market mechanism. This paper investigates the use of conditional generative models for order book simulation. For developing a tr…
Ordinal Potential-based Player Rating
Nelson Vadori, Rahul Savani
It was recently observed that Elo ratings fail at preserving transitive relations among strategies and therefore cannot correctly extract the transitive component of a game. We pro…