108 search results - page 17 / 22 » -Hardness of Pure Nash Equilibrium in Scheduling and Connect... |
AAIM
2009
Springer
14 years 1 months ago
2009
Springer
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the u...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
—Considering the interaction through mutual interference of the different radio devices, the channel selection (CS) problem in decentralized parallel multiple access channels can...
VTC
2010
IEEE
13 years 5 months ago
2010
IEEE
— In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed ...
SIGECOM
2009
ACM
14 years 1 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 ...