63 search results - page 8 / 13 » The computational complexity of nash equilibria in concisely... |
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
SIGECOM
2010
ACM
13 years 8 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
WINE
2005
Springer
14 years 2 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...