Best-Effort Strategies for Losing States
| dc.creator | Faella, Marco | |
| dc.date | 2008-11-11 | |
| dc.date.accessioned | 2026-07-07T10:17:26Z | |
| dc.date.available | 2026-07-07T10:17:26Z | |
| dc.description | 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. | |
| dc.description | Technical report derived from the GAMES'07 talk "Games you cannot win" | |
| dc.identifier | https://arxiv.org/abs/0811.1664 | |
| dc.identifier | http://arxiv.org/abs/0811.1664 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/173853 | |
| dc.subject | Computer Science and Game Theory | |
| dc.title | Best-Effort Strategies for Losing States | |
| dc.type | text |