REVIEW 1 cited by
Combining local search techniques and path following for bimatrix games
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Computing a Nash equilibrium (NE) is a central task in computer science. An NE is a particularly appropriate solution concept for two-agent settings because coalitional deviations are not an issue. However, even in this case, finding an NE is PPAD-complete. In this paper, we combine path following algorithms with local search techniques to design new algorithms for finding exact and approximate NEs. We show that our algorithms largely outperform the state of the art and that almost all the known benchmark game classes are easily solvable or approximable (except for the GAMUT CovariantGameRand class).
Forward citations
Cited by 1 Pith paper
-
Approximating Nash Equilibria in General-Sum Games via Meta-Learning
Meta-learning a regret minimizer to minimize correlation in coarse-correlated equilibria yields far better Nash equilibrium approximations in general-sum games than prior regret minimization techniques.
Discussion (0). Continue with ORCID to comment.