Skip to main content
Journal Article

When can you play positionally?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3153 686-697
DOI: 10.1007/978-3-540-28629-5_53
37Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless) optimal strategies. To verify the robustness of our conditions we show that all popular payoff mappings, such as mean payoff, discounted, parity as well as several other payoffs satisfy them. © Springer-Verlag 2004 References.

Cite

CITATION STYLE

APA

Gimbert, H., & Zielonka, W. (2004). When can you play positionally? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3153, 686–697. https://doi.org/10.1007/978-3-540-28629-5_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free