60 search results - page 3 / 12 » The Price of Anarchy in Cooperative Network Creation Games |
SAGT
2009
Springer
14 years 1 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
CAAN
2004
Springer
14 years 8 days ago
2004
Springer
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...
GLOBECOM
2009
IEEE
14 years 1 months ago
2009
IEEE
—In this paper, we model and analyze the interactions between secondary users in a spectrum overlay cognitive system as a cognitive MAC game. In this game, each secondary user ca...
SIGECOM
2008
ACM
13 years 6 months ago
2008
ACM
In this paper, we study the price of anarchy of traffic routing, under the assumption that users are partially altruistic or spiteful. We model such behavior by positing that the ...
WAOA
2005
Springer
14 years 10 days ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...