Journal article icon

Journal article

Trapping games on random boards

Abstract:

We consider the following two-player game on a graph. A token is located at a vertex, and the players take turns to move it along an edge to a vertex that has not been visited before. A player who cannot move loses. We analyze outcomes with optimal play on percolation clusters of Euclidean lattices.

On Z2 with two different percolation parameters for odd and even sites, we prove that the game has no draws provided closed sites of one parity are sufficiently rare compared with those ...

Expand abstract
Publication status:
In press
Peer review status:
Peer reviewed

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Statistics
Holroyd, AE More by this author
Wastlund, J More by this author
U.C. Berkeley More from this funder
Swedish Research Council More from this funder
Knut and Alice Wallenberg Foundation More from this funder
Goran Gustafsson Foundation More from this funder
Publisher:
Institute of Mathematical Statistics (IMS) Publisher's website
Journal:
Annals of Applied Probability Journal website
Publication date:
2016-02-05
ISSN:
1050-5164
URN:
uuid:e8ce7dea-1da3-43e1-8c03-4905716f281a
Source identifiers:
606932
Local pid:
pubs:606932

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP