DeepAI AI Chat
Log In Sign Up

Autocratic Strategies of Multi-State Games

by   Mario Palasciano, et al.

In a single-state repeated game, zero-determinant strategies can unilaterally force functions of the payoffs to take values in particular closed intervals. When the explicit use of a determinant is absent from the analysis, they are instead called autocratic. We extend their study to the setting of finite state games with deterministic transitions. For a given game we find that the endpoints of the intervals of enforceable values must satisfy fixed point equations. From these extreme enforceable values we show it is always possible to construct finite memory strategies to enforce a particular value. An algorithm is presented which will approximate the enforceable values in each state. Finally, we present formulas from which the exact solutions can be recovered from the approximate solution.


page 1

page 2

page 3

page 4


Memory-two zero-determinant strategies in repeated games

We extend the concept of zero-determinant strategies to memory-two strat...

Semiring Provenance for Büchi Games: Strategy Analysis with Absorptive Polynomials

This paper presents a case study for the application of semiring semanti...

Controlling conditional expectations by zero-determinant strategies

We show that memory-n zero-determinant strategies in repeated games can ...

Necessary and Sufficient Condition for the Existence of Zero-Determinant Strategies in Repeated Games

Zero-determinant strategies are a class of memory-one strategies in repe...

State Complexity of Chromatic Memory in Infinite-Duration Games

A major open problem in the area of infinite-duration games is to charac...

Polyhedral value iteration for discounted games and energy games

We present a deterministic algorithm, solving discounted games with n no...

Finite-state Strategies in Delay Games

What is a finite-state strategy in a delay game? We answer this surprisi...