53 search results - page 5 / 11 » Computing equilibria for congestion games with (im)perfect i... |
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...
IPTPS
2004
Springer
14 years 1 months ago
2004
Springer
In P2P systems, users often have many choices of peers from whom to download their data. Each user cares primarily about its own response time, which depends on how many other use...
MOBIHOC
2012
ACM
11 years 10 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
WINE
2007
Springer
14 years 1 months ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...