Sciweavers

344 search results - page 21 / 69
» Banach-Mazur Games on Graphs
Sort
View
CPC
2010
74views more  CPC 2010»
13 years 6 months ago
Playing to Retain the Advantage
Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...
Noga Alon, Dan Hefetz, Michael Krivelevich
AAIM
2009
Springer
105views Algorithms» more  AAIM 2009»
14 years 3 months ago
On Acyclicity of Games with Cycles
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm...
CPC
2002
205views more  CPC 2002»
13 years 8 months ago
Convergence Of The Iterated Prisoner's Dilemma Game
Co-learning is a model involving agents from a large population, who interact by playing a fixed game and update their behaviour based on previous experience and the outcome of th...
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...
CORR
2012
Springer
229views Education» more  CORR 2012»
12 years 4 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
FSEN
2009
Springer
14 years 3 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas