Sciweavers

9 search results - page 1 / 2
» Nash Equilibria for Reachability Objectives in Multi-player ...
Sort
View
FORMATS
2010
Springer
13 years 9 months ago
Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformation...
Patricia Bouyer, Romain Brenguier, Nicolas Markey
CSR
2010
Springer
14 years 3 months ago
Equilibria in Quantitative Reachability Games
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In this framework each player aims at reaching...
Thomas Brihaye, Véronique Bruyère, J...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 4 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
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
14 years 4 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...