Sciweavers

224 search results - page 22 / 45
» On Nash-Equilibria of Approximation-Stable Games
Sort
View
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 7 months ago
The Hitchhiker's Guide to Affiliation Networks: A Game-Theoretic Approach
We propose a new class of game-theoretic models for network formation in which strategies are not directly related to edge choices, but instead correspond more generally to the ex...
Christian Borgs, Jennifer T. Chayes, Jian Ding, Br...
JSAC
2008
102views more  JSAC 2008»
13 years 7 months ago
Inefficient Noncooperation in Networking Games of Common-Pool Resources
We study in this paper a noncooperative approach for sharing resources of a common pool among users, wherein each user strives to maximize its own utility. The optimality notion is...
Hisao Kameda, Eitan Altman
ICALP
2007
Springer
14 years 1 months ago
Strong Price of Anarchy for Machine Load Balancing
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for loa...
Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olon...
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 7 months ago
Capacitated Caching Games
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Na...
TON
2010
157views more  TON 2010»
13 years 2 months ago
Random Access Game and Medium Access Control Design
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
Lijun Chen, Steven H. Low, John C. Doyle