Zero-determinant strategies in repeated incomplete-information games: Consistency of payoff relations

07/02/2018
by   Masahiko Ueda, et al.
0

We derive zero-determinant strategies for general multi-player multi-action repeated incomplete-information games. By formulating zero-determinant strategy in terms of linear algebra, we prove that linear payoff relations assigned by players always have solutions. An example for zero-determinant strategy in a repeated incomplete-information game is also provided.

READ FULL TEXT
research
11/13/2020

Memory-two zero-determinant strategies in repeated games

We extend the concept of zero-determinant strategies to memory-two strat...
research
09/28/2020

Zero Knowledge Games

Zero-knowledge strategies as a form of inference and reasoning operate u...
research
04/25/2019

Smart Jammer and LTE Network Strategies in An Infinite-Horizon Zero-Sum Repeated Game with Asymmetric and Incomplete Information

LTE/LTE-Advanced networks are known to be vulnerable to denial-of-servic...
research
07/05/2018

Surprising strategies obtained by stochastic optimization in partially observable games

This paper studies the optimization of strategies in the context of poss...
research
06/19/2018

Approximation Strategies for Incomplete MaxSAT

Incomplete MaxSAT solving aims to quickly find a solution that attempts ...
research
07/07/2021

A Formula for Designing Zero-Determinant Strategies

A formula is presented for designing zero-determinant(ZD) strategies of ...
research
10/31/2021

Adapting paths against zero-determinant strategies in repeated prisoner's dilemma games

Long-term cooperation, competition, or exploitation among individuals ca...

Please sign up or login with your details

Forgot password? Click here to reset