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

Uriel Feige*, Inbal Talgam-Cohen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publicationAlgorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings
Pages138-149
Number of pages12
EditionM4D
DOIs
StatePublished - 2010
Externally publishedYes
Event3rd International Symposium on Algorithmic Game Theory, SAGT 2010 - Athens, Greece
Duration: 18 Oct 201020 Oct 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberM4D
Volume6386 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Symposium on Algorithmic Game Theory, SAGT 2010
Country/TerritoryGreece
CityAthens
Period18/10/1020/10/10

Funding

FundersFunder number
Israel Science Foundation873/08

    Fingerprint

    Dive into the research topics of 'A direct reduction from k-player to 2-player approximate nash equilibrium'. Together they form a unique fingerprint.

    Cite this