Sciweavers

142 search results - page 13 / 29
» Computing Nash Equilibria: Approximation and Smoothed Comple...
Sort
View
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Network Load Games
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...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
JAIR
2011
214views more  JAIR 2011»
12 years 10 months ago
Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness
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 mo...
Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintve...
ATAL
2010
Springer
13 years 8 months ago
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
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...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...
SIGECOM
2010
ACM
154views ECommerce» more  SIGECOM 2010»
14 years 10 days ago
Ranking games that have competitiveness-based strategies
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Kryst...
ICDCS
2010
IEEE
13 years 11 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...