Computing Approximate Nash Equilibria in Polymatrix Games

DOI10.1007/978-3-319-13129-0_5zbMath1404.91008arXiv1409.3741OpenAlexW2596997350MaRDI QIDQ2936976

Rahul Savani, Argyrios Deligkas, John Fearnley, Paul G. Spirakis

Publication date: 7 January 2015

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.3741

zbMATH Keywords

polymatrix gamesapproximate Nash equilibriaPPAD-hardness

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (4)

Inapproximability of Nash Equilibrium ⋮ Approximating Nash Equilibria in Tree Polymatrix Games ⋮ Computing approximate Nash equilibria in polymatrix games ⋮ Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution

This page was built for publication: Computing Approximate Nash Equilibria in Polymatrix Games