108 search results - page 16 / 22 » -Hardness of Pure Nash Equilibrium in Scheduling and Connect... |
DAGSTUHL
2007
13 years 8 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
In this paper we address the problem of efficient power allocation in the uplink of CDMA wireless networks, emphasizing on the support of realtime services’ QoS prerequisites. Th...
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
IM
2008
13 years 7 months ago
2008
Abstract. Congestion games are a well-studied model for resource sharing among uncoordinated selfish agents. Usually, one assumes that the resources in a congestion game do not hav...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we introduce a novel flow representation for finite games in strategic form. This representation allows us to develop a canonical direct sum decomposition of an arbi...