dc.contributor.author |
Khoussainov, B |
en |
dc.contributor.author |
Yakhnis, A |
en |
dc.contributor.author |
Yakhnis, V |
en |
dc.date.accessioned |
2009-04-16T23:12:16Z |
en |
dc.date.available |
2009-04-16T23:12:16Z |
en |
dc.date.issued |
1997-05 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-035 (1997) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3544 |
en |
dc.description.abstract |
We introduce a new notion of a cluster of infinite two player games between
players 0 and 1. This is an infinite collection of games whose game trees can be
composed into a graph which is similar to a tree except that the graph might not
have the initial node. For each node of the graph there is an ancesstor node. We
call this graph the arena of the cluster. For a game cluster we introduce a notion
of a winner for the whole cluster. This notion is weaker than the requirement
to win every game of the cluster. Any two player game can be viewed as a game
cluster consisting of all its residual games [3, 18]. We extend the restricted memory
determinacy (RMD) theorem of Gurevich-Harrington (GH), [3] to game clusters.
We think that the notion of a game cluster improves the modeling power of two
player games used to give semantics for concurrent processes [10, 11]. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial |
en |
dc.title |
Clusters of Two Player Games and Restricted Determinacy Theorem |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |