How do we remember the past in randomised strategies?

Details How do we remember the past in randomised strategies? How do we remember the past in randomised strategies?

2010-06-08

arxiv.org/abs/1006.1404v1

EPTCS 25, 2010, pp. 30-39

Computer Science

Computer Science and Game Theory

Scientific paper

10.4204/EPTCS.25.7

Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies.

Affiliated with

Also associated with

No associations

Rating

How do we remember the past in randomised strategies? 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 How do we remember the past in randomised strategies?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How do we remember the past in randomised strategies? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29296