Sciweavers

144 search results - page 27 / 29
» Computing Nash Equilibria of Action-Graph Games
Sort
View
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
13 years 10 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
ICDCS
2010
IEEE
14 years 10 days 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,...
MST
2011
184views Hardware» more  MST 2011»
13 years 3 months ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
Tobias Harks
CCS
2009
ACM
14 years 3 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
ICS
2010
Tsinghua U.
14 years 5 months ago
Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior
: 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...
Maria-Florina Balcan, Avrim Blum, Yishay Mansour