60 search results - page 4 / 12 » The Price of Anarchy in Cooperative Network Creation Games |
SUTC
2010
IEEE
13 years 11 months ago
2010
IEEE
— Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However, due to the caching problem’s theoretical root ...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
— Most of the previous work on network coding has assumed that the users are not selfish and always follow the designed coding schemes. However, recent results have shown that s...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
IDC
2009
Springer
14 years 2 months ago
2009
Springer
Scheduling meetings among agents can be represented as a game - the Meetings Scheduling Game (MSG). In its simplest form, the two-person MSG is shown to have a price of anarchy (Po...