Search Sciweavers | Sciweavers

119 search results - page 10 / 24

» The complexity of pure Nash equilibria

click to vote

CORR
2007
Springer

135views Education» more CORR 2007»

Settling the Complexity of Computing Two-Player Nash Equilibria

14 years 11 months ago

Download www.cs.bu.edu

We prove that Bimatrix, the problem of ﬁnding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)

Xi Chen, Xiaotie Deng, Shang-Hua Teng

claim paper

Read More »

104

click to vote

IPL
2010

139views more IPL 2010»

A note on competitive diffusion through social networks

14 years 9 months ago

Download www.math.tau.ac.il

We introduce a game-theoretic model of diffusion of technologies, advertisements, or influence through a social network. The novelty in our model is that the players are intereste...

Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...

claim paper

Read More »

click to vote

FCT
2005
Springer

119views Applied Computing» more FCT 2005»

On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems

15 years 5 months ago