DeepAI AI Chat
Log In Sign Up

Controlling conditional expectations by zero-determinant strategies

12/17/2020
by   Masahiko Ueda, et al.
0

We show that memory-n zero-determinant strategies in repeated games can be used to control conditional averages of payoffs. Equivalently, they can be used to control average payoffs in biased ensembles. We provide several examples of memory-n zero-determinant strategies in repeated prisoner's dilemma game. We also explain that a deformed version of zero-determinant strategies is easily extended to the memory-n case.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/13/2020

Memory-two zero-determinant strategies in repeated games

We extend the concept of zero-determinant strategies to memory-two strat...
05/30/2022

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...
02/25/2019

Pure Strategy Best Responses to Mixed Strategies in Repeated Games

Repeated games are difficult to analyze, especially when agents play mix...
12/29/2020

Autocratic Strategies of Multi-State Games

In a single-state repeated game, zero-determinant strategies can unilate...
07/17/2018

Payoff Control in the Iterated Prisoner's Dilemma

Repeated game has long been the touchstone model for agents' long-run re...
01/24/2022

Reasoning about Human-Friendly Strategies in Repeated Keyword Auctions

In online advertising, search engines sell ad placements for keywords co...
11/27/2019

Stability of defection, optimisation of strategies and the limits of memory in the Prisoner's Dilemma

Memory-one strategies are a set of Iterated Prisoner's Dilemma strategie...