Sciweavers

30 search results - page 3 / 6
» Choosing Samples to Compute Heuristic-Strategy Nash Equilibr...
Sort
View
WINE
2005
Springer
179views Economy» more  WINE 2005»
13 years 11 months ago
A Graph-Theoretic Network Security Game
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...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
ATAL
2003
Springer
13 years 11 months ago
Miscomputing ratio: social cost of selfish computing
Auctions are useful mechanism for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders’ valuations for ite...
Kate Larson, Tuomas Sandholm
ATAL
2010
Springer
13 years 6 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...
ATAL
2007
Springer
13 years 12 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 11 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust