37 search results - page 2 / 8 » The Complexity of Equilibria in Cost Sharing Games |
ACID
2006
13 years 6 months ago
2006
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 ...
CDC
2009
IEEE
13 years 9 months ago
2009
IEEE
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
SPAA
2006
ACM
13 years 10 months ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
DIALM
2003
ACM
13 years 10 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—Peer-to-peer (P2P) networks offer a cost effective and easily deployable framework for sharing user-generated content. However, intrinsic incentive problems reside in P2P networ...