Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

STOC
2006
ACM

favoriteEmaildiscussreport

59views Algorithms» more STOC 2006»

Reducibility among equilibrium problems

14 years 4 months ago

Reducibility among equilibrium problems

Download eccc.hpi-web.de

In this paper, we improve a recent result of Daskalakis, Goldberg and Papadimitriou on PPAD-completeness of 4-Nash, showing that 3-Nash is PPAD-complete.

Paul W. Goldberg, Christos H. Papadimitriou

Real-time Traffic

Algorithms | STOC 2006 |

claim paper

Related Content

» Reducibility among Fractional Stability Problems

» A technique for reducing normalform games to compute a Nash equilibrium

» Dynamic spectrum management with the competitive market model

» MultiIndex Cooperative Mixed Strategy for Service Selection Problem in ServiceOriented Arc...

» A Computational Analysis of the Tournament Equilibrium Set

» A Normal Form for Linear Temporal Equilibrium Logic

» GameTheoretic Strategies and Equilibriums in Multimedia Fingerprinting Social Networks

» A Game Theoretic Framework for Distributed SelfCoexistence Among IEEE 80222 Networks

» Understanding XCP equilibrium and fairness

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2006
Where	STOC
Authors	Paul W. Goldberg, Christos H. Papadimitriou

Comments (0)