80 search results - page 11 / 16 » Existence of Nash Equilibria in Selfish Routing Problems |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
DSS
2000
13 years 7 months ago
2000
This paper studies the quality of service (QoS) provision problem in noncooperative networks where applications or users are sel sh and routers implement generalized processor sha...
TWC
2010
13 years 2 months ago
2010
Delay Tolerant Networks (DTNs) are a class of networks characterized by lack of guaranteed connectivity, typically low frequency of encounters between DTN nodes and long propagatio...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Channel allocation was extensively studied in the framework of cellular networks. But the emergence of new system concepts, such as cognitive radio systems, has brought this to...