Alexander Kozachinskiy - Continuous Positional Payoffs

lmcs:9213 - Logical Methods in Computer Science, August 3, 2023, Volume 19, Issue 3 -
Continuous Positional PayoffsArticle

Authors: Alexander Kozachinskiy

    What payoffs are positionally determined for deterministic two-player antagonistic games on finite directed graphs? In this paper we study this question for payoffs that are continuous. The main reason why continuous positionally determined payoffs are interesting is that they include the multi-discounted payoffs. We show that for continuous payoffs, positional determinacy is equivalent to a simple property called prefix-monotonicity. We provide three proofs of it, using three major techniques of establishing positional determinacy -- inductive technique, fixed point technique and strategy improvement technique. A combination of these approaches provides us with better understanding of the structure of continuous positionally determined payoffs as well as with some algorithmic results.

    Volume: Volume 19, Issue 3
    Published on: August 3, 2023
    Accepted on: June 13, 2023
    Submitted on: March 15, 2022
    Keywords: Computer Science - Computer Science and Game Theory
      Source : OpenAIRE Graph
    • Solving Parity Games in Theory and Practice; Funder: UK Research and Innovation; Code: EP/P020992/1

    Consultation statistics

    This page has been seen 1110 times.
    This article's PDF has been downloaded 294 times.