Sciweavers

51 search results - page 1 / 11
» Convergence Issues in Competitive Games
Sort
View
APPROX
2004
Springer
110views Algorithms» more  APPROX 2004»
13 years 10 months ago
Convergence Issues in Competitive Games
Vahab S. Mirrokni, Adrian Vetta
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
14 years 5 months ago
On the convergence of regret minimization dynamics in concave games
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
Eyal Even-Dar, Yishay Mansour, Uri Nadav
AIM
2005
13 years 4 months ago
General Game Playing: Overview of the AAAI Competition
A General Game Playing System is one that can accept a formal description of a game and play the game effectively without human intervention. Unlike specialized game players, such...
Michael R. Genesereth, Nathaniel Love, Barney Pell
SODA
2012
ACM
278views Algorithms» more  SODA 2012»
11 years 7 months ago
Beyond myopic best response (in Cournot competition)
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yish...
ACID
2006
298views Algorithms» more  ACID 2006»
13 years 6 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking