9 search results - page 1 / 2 » Polynomial-time computation of exact correlated equilibrium ... |
SIGECOM
2011
ACM
12 years 7 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
FOCS
2008
IEEE
13 years 4 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
SODA
2010
ACM
13 years 2 months ago
2010
ACM
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
SIGECOM
2003
ACM
13 years 9 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...