68 search results - page 12 / 14 » New Algorithms for Approximate Nash Equilibria in Bimatrix G... |
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
AMC
2008
13 years 7 months ago
2008
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
SIGECOM
2011
ACM
12 years 10 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...
JAIR
2008
13 years 7 months ago
2008
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Due to the complexity of the problem, the majority of the previo...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...