Computer Science – Computer Science and Game Theory
Scientific paper
2010-06-03
Computer Science
Computer Science and Game Theory
Scientific paper
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (both players interact simultaneously); and (b) turn-based (both players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. In this work we present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games.
Chatterjee Krishnendu
Doyen Laurent
Gimbert Hugo
Henzinger Thomas A.
No associations
LandOfFree
Randomness for Free does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Randomness for Free, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomness for Free will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-513887