Computer Science – Computer Science and Game Theory
Scientific paper
2008-11-11
Computer Science
Computer Science and Game Theory
Technical report derived from the GAMES'07 talk "Games you cannot win"
Scientific paper
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a win. We explore and compare several criteria for establishing what is the preferable behavior of Player 1 from those states. Along the way, we prove several results of theoretical and practical interest, such as a characterization of admissible strategies, which also provides a simple algorithm for computing such strategies for various common goals, and the equivalence between the existence of positional winning strategies and the existence of positional subgame perfect strategies.
No associations
LandOfFree
Best-Effort Strategies for Losing States 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 Best-Effort Strategies for Losing States, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Best-Effort Strategies for Losing States will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-543373