Sciweavers

1087 search results - page 9 / 218
» Dynamics in congestion games
Sort
View
SAGT
2009
Springer
113views Game Theory» more  SAGT 2009»
14 years 3 months ago
Games with Congestion-Averse Utilities
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...
Andrew Byde, Maria Polukarov, Nicholas R. Jennings
AMC
2006
86views more  AMC 2006»
13 years 8 months ago
On dynamical multi-team and signaling games
Dynamic multi-team games are introduced. In these games Pareto optimality is used within the team but Nash equilibrium is sought between different teams. Puu
E. Ahmed, A. S. Hegazi
TGC
2010
Springer
13 years 6 months ago
The Impact of Altruism on the Efficiency of Atomic Congestion Games
We study the effect of combining selfishness and altruism in atomic congestion games. We allow players to be partially altruistic and partially selfish and determine the impact of ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
STOC
2005
ACM
122views Algorithms» more  STOC 2005»
14 years 9 months ago
The price of anarchy of finite congestion games
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
George Christodoulou, Elias Koutsoupias
CAAN
2004
Springer
14 years 2 months ago
Congestion Games, Load Balancing, and Price of Anarchy
Imagine a set of self-interested clients, each of whom must choose a server from a permissible set. A server’s latency is inversely proportional to its speed, but it grows linear...
Anshul Kothari, Subhash Suri, Csaba D. Tóth...