Continuous Positional Payoffs

12/16/2020
by   Alexander Kozachinskiy, et al.
0

What payoffs are positional 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 positional payoffs are interesting is that they include multi-discounted payoffs. We show that for continuous payoffs positionality is equivalent to a simple property called prefix-monotonicity. In fact, we show that three major techniques of establishing positionality – inductive technique, fixed point technique and strategy improvement technique – are all sufficient to obtain this result. Finally, we study analogous questions for more general stochastic games. It turns out that all continuous stochastically positional payoffs are multi-discounted. As a byproduct, this refutes a conjecture of Gimbert (STACS 2007), who conjectured that all deterministically positional payoffs are stochastically positional.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/21/2021

Finite-memory strategies in two-player infinite games

We study infinite two-player win/lose games (A,B,W) where A,B are finite...
research
10/27/2021

Optimal strategies in concurrent reachability games

We study two-player reachability games on finite graphs. At each state t...
research
09/24/2019

On Communication Complexity of Fixed Point Computation

Brouwer's fixed point theorem states that any continuous function from a...
research
09/09/2021

Multiple Oracle Algorithm For General-Sum Continuous Games

Continuous games have compact strategy sets and continuous utility funct...
research
08/04/2022

Continuous guts poker and numerical optimization of generalized recursive games

We study a type of generalized recursive game introduced by Castronova, ...
research
12/04/2019

On stability of users equilibria in heterogeneous routing games

The asymptotic behaviour of deterministic logit dynamics in heterogeneou...
research
03/19/2018

Computational topology and the Unique Games Conjecture

Covering spaces of graphs have long been useful for studying expanders (...

Please sign up or login with your details

Forgot password? Click here to reset