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

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro