Sciweavers

26 search results - page 2 / 6
» The Complexity of Solving Stochastic Games on Graphs
Sort
View
CIE
2008
Springer
13 years 6 months ago
Deterministic Graphical Games Revisited
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
Daniel Andersson, Kristoffer Arnsfelt Hansen, Pete...
CORR
2008
Springer
208views Education» more  CORR 2008»
13 years 5 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
IM
2007
13 years 4 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 5 months ago
Stochastic Games for Security in Networks with Interdependent Nodes
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...
Kien C. Nguyen, Tansu Alpcan, Tamer Basar
FSTTCS
2008
Springer
13 years 6 months ago
Average-Time Games
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
Marcin Jurdzinski, Ashutosh Trivedi