35 search results - page 6 / 7 » Computing pure strategy nash equilibria in compact symmetric... |
MOBIHOC
2004
ACM
13 years 11 months ago
2004
ACM
In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architec...
WINE
2009
Springer
14 years 21 days ago
2009
Springer
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...
WINE
2009
Springer
14 years 21 days ago
2009
Springer
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
SIGECOM
2008
ACM
13 years 6 months ago
2008
ACM
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
WINE
2005
Springer
13 years 11 months ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...