13 search results - page 2 / 3 » Computing Pure Nash and Strong Equilibria in Bottleneck Cong... |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-intereste...
MOBIHOC
2012
ACM
11 years 7 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...
MOBIHOC
2004
ACM
13 years 10 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...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...