Sciweavers

53 search results - page 7 / 11
» Computing equilibria for congestion games with (im)perfect i...
Sort
View
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 2 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
IPL
2006
92views more  IPL 2006»
13 years 7 months ago
A constructive approach to sequential Nash equilibria
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
René Vestergaard
JSAC
2008
140views more  JSAC 2008»
13 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
ATAL
2005
Springer
14 years 1 months ago
The value of privacy: optimal strategies for privacy minded agents
Agents often want to protect private information, while at the same acting upon the information. These two desires are in conflict, and this conflict can be modeled in strategic...
Sieuwert van Otterloo
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...