Search Results for author: Paul W. Goldberg

Found 5 papers, 2 papers with code

The Computational Complexity of Single-Player Imperfect-Recall Games

no code implementations28 May 2023 Emanuel Tewolde, Caspar Oesterheld, Vincent Conitzer, Paul W. Goldberg

For such games, two natural equilibrium concepts have been proposed as alternative solution concepts to ex-ante optimality.

The Complexity of Gradient Descent: CLS = PPAD $\cap$ PLS

1 code implementation3 Nov 2020 John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani

We study search problems that can be solved by performing Gradient Descent on a bounded convex polytopal domain and show that this class is equal to the intersection of two well-known classes: PPAD and PLS.

Solving Strong-Substitutes Product-Mix Auctions

1 code implementation16 Sep 2019 Elizabeth Baldwin, Paul W. Goldberg, Paul Klemperer, Edwin Lock

This paper develops algorithms to solve strong-substitutes product-mix auctions.

Computer Science and Game Theory Data Structures and Algorithms

Learning Convex Partitions and Computing Game-theoretic Equilibria from Best Response Queries

no code implementations17 Jul 2018 Paul W. Goldberg, Francisco J. Marmolejo-Cossío

Suppose that an $m$-simplex is partitioned into $n$ convex regions having disjoint interiors and distinct labels, and we may learn the label of any point by querying it.

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

no code implementations31 May 2018 Aris Filos-Ratsikas, Paul W. Goldberg

We do this via a PPA-completeness result for an approximate version of the CONSENSUS-HALVING problem, strengthening our recent result that the problem is PPA-complete for inverse-exponential precision.

Cannot find the paper you are looking for? You can Submit a new open access paper.