Sciweavers

37 search results - page 5 / 8
» The Complexity of Equilibria in Cost Sharing Games
Sort
View
64
Voted
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
15 years 4 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu
AAAI
2000
14 years 11 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
PODC
2010
ACM
15 years 1 months ago
Bayesian ignorance
We quantify the effect of Bayesian ignorance by comparing the social cost obtained in a Bayesian game by agents with local views to the expected social cost of agents having glob...
Noga Alon, Yuval Emek, Michal Feldman, Moshe Tenne...
JSAC
2008
102views more  JSAC 2008»
14 years 9 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
WINE
2009
Springer
184views Economy» more  WINE 2009»
15 years 4 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...