A direct reduction from k-player to 2-player approximate nash equilibrium

Uriel Feige; Inbal Talgam-Cohen

doi:10.1007/978-3-642-16170-4_13

A direct reduction from k-player to 2-player approximate nash equilibrium

Uriel Feige^*, Inbal Talgam-Cohen

^*Corresponding author for this work

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

We present a direct reduction from k-player games to 2-player games that preserves approximate Nash equilibrium. Previously, the computational equivalence of computing approximate Nash equilibrium in k-player and 2-player games was established via an indirect reduction. This included a sequence of works defining the complexity class PPAD, identifying complete problems for this class, showing that computing approximate Nash equilibrium for k-player games is in PPAD, and reducing a PPAD-complete problem to computing approximate Nash equilibrium for 2-player games. Our direct reduction makes no use of the concept of PPAD, eliminating some of the difficulties involved in following the known indirect reduction.

Original language	English
Title of host publication	Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings
Pages	138-149
Number of pages	12
Edition	M4D
DOIs	https://doi.org/10.1007/978-3-642-16170-4_13
State	Published - 2010
Externally published	Yes
Event	3rd International Symposium on Algorithmic Game Theory, SAGT 2010 - Athens, Greece Duration: 18 Oct 2010 → 20 Oct 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	M4D
Volume	6386 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd International Symposium on Algorithmic Game Theory, SAGT 2010
Country/Territory	Greece
City	Athens
Period	18/10/10 → 20/10/10

Funding

Funders	Funder number
Israel Science Foundation	873/08

Access to Document

10.1007/978-3-642-16170-4_13

Cite this

Feige, U., & Talgam-Cohen, I. (2010). A direct reduction from k-player to 2-player approximate nash equilibrium. In Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings (M4D ed., pp. 138-149). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6386 LNCS, No. M4D). https://doi.org/10.1007/978-3-642-16170-4_13

@inproceedings{3edd322ca61c438d926662b752c5d62b,

title = "A direct reduction from k-player to 2-player approximate nash equilibrium",

abstract = "We present a direct reduction from k-player games to 2-player games that preserves approximate Nash equilibrium. Previously, the computational equivalence of computing approximate Nash equilibrium in k-player and 2-player games was established via an indirect reduction. This included a sequence of works defining the complexity class PPAD, identifying complete problems for this class, showing that computing approximate Nash equilibrium for k-player games is in PPAD, and reducing a PPAD-complete problem to computing approximate Nash equilibrium for 2-player games. Our direct reduction makes no use of the concept of PPAD, eliminating some of the difficulties involved in following the known indirect reduction.",

author = "Uriel Feige and Inbal Talgam-Cohen",

note = "Funding Information: A full version of this paper is available at http://arxiv.org/abs/1007.3886 . Work supported in part by The Israel Science Foundation (grant No. 873/08).; 3rd International Symposium on Algorithmic Game Theory, SAGT 2010 ; Conference date: 18-10-2010 Through 20-10-2010",

year = "2010",

doi = "10.1007/978-3-642-16170-4_13",

language = "אנגלית",

isbn = "3642161693",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "M4D",

pages = "138--149",

booktitle = "Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings",

edition = "M4D",

}

Feige, U & Talgam-Cohen, I 2010, A direct reduction from k-player to 2-player approximate nash equilibrium. in Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings. M4D edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. M4D, vol. 6386 LNCS, pp. 138-149, 3rd International Symposium on Algorithmic Game Theory, SAGT 2010, Athens, Greece, 18/10/10. https://doi.org/10.1007/978-3-642-16170-4_13

A direct reduction from k-player to 2-player approximate nash equilibrium. / Feige, Uriel; Talgam-Cohen, Inbal.
Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings. M4D. ed. 2010. p. 138-149 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6386 LNCS, No. M4D).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A direct reduction from k-player to 2-player approximate nash equilibrium

AU - Feige, Uriel

AU - Talgam-Cohen, Inbal

N1 - Funding Information: A full version of this paper is available at http://arxiv.org/abs/1007.3886 . Work supported in part by The Israel Science Foundation (grant No. 873/08).

PY - 2010

Y1 - 2010

N2 - We present a direct reduction from k-player games to 2-player games that preserves approximate Nash equilibrium. Previously, the computational equivalence of computing approximate Nash equilibrium in k-player and 2-player games was established via an indirect reduction. This included a sequence of works defining the complexity class PPAD, identifying complete problems for this class, showing that computing approximate Nash equilibrium for k-player games is in PPAD, and reducing a PPAD-complete problem to computing approximate Nash equilibrium for 2-player games. Our direct reduction makes no use of the concept of PPAD, eliminating some of the difficulties involved in following the known indirect reduction.

AB - We present a direct reduction from k-player games to 2-player games that preserves approximate Nash equilibrium. Previously, the computational equivalence of computing approximate Nash equilibrium in k-player and 2-player games was established via an indirect reduction. This included a sequence of works defining the complexity class PPAD, identifying complete problems for this class, showing that computing approximate Nash equilibrium for k-player games is in PPAD, and reducing a PPAD-complete problem to computing approximate Nash equilibrium for 2-player games. Our direct reduction makes no use of the concept of PPAD, eliminating some of the difficulties involved in following the known indirect reduction.

UR - http://www.scopus.com/inward/record.url?scp=78649628626&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-16170-4_13

DO - 10.1007/978-3-642-16170-4_13

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:78649628626

SN - 3642161693

SN - 9783642161698

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 138

EP - 149

BT - Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings

T2 - 3rd International Symposium on Algorithmic Game Theory, SAGT 2010

Y2 - 18 October 2010 through 20 October 2010

ER -

Feige U, Talgam-Cohen I. A direct reduction from k-player to 2-player approximate nash equilibrium. In Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings. M4D ed. 2010. p. 138-149. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); M4D). doi: 10.1007/978-3-642-16170-4_13

A direct reduction from k-player to 2-player approximate nash equilibrium

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this