In asymmetric zero-sum games, one player has superior information about the game over the other. It is known that the informed players (maximizer) face the tradeoff of exploiting its superior information at the cost of revealing its superior information, but the basic point of the uninformed player (minimizer)'s decision making remains unknown. This paper studies the finite stage asymmetric repeated games from both players' viewpoints, and derives that not only security strategies but also the opponents' corresponding best responses depends only on the informed player's history action sequences. Moreover, efficient LP formulations to compute both player's security strategies are provided.
|Title of host publication
|2016 IEEE 55th Conference on Decision and Control (CDC)
|Institute of Electrical and Electronics Engineers (IEEE)
|Number of pages
|Published - Jan 5 2017
Bibliographical noteKAUST Repository Item: Exported on 2020-10-01
Acknowledgements: The authors acknowledge the financial support of ARO project #W911NF-09-1-0553 and the AFOSR/MURI project #FA9550-10-1-0573