Strategic entropy and complexity in repeated games

Citation:

Abraham Neyman and Okada, Daijiro . 1999. “Strategic Entropy And Complexity In Repeated Games”. Games And Economic Behavior, 29, Pp. 191–223.

Abstract:

We introduce the entropy-based measure of uncertainty for mixed strategies of repeated games-strategic entropy. We investigate the asymptotic behavior of the maxmin values of repeated two-person zero-sum games with a bound on the strategic entropy of player 1’s strategies while player 2 is unrestricted, as the bound grows to infinity. We apply the results thus obtained to study the asymptotic behavior of the value of the repeated games with finite automata and bounded recall.