English

On repeated zero-sum games with incomplete information and asymptotically bounded values

Computer Science and Game Theory 2016-09-14 v2 Optimization and Control

Abstract

We consider repeated zero-sum games with incomplete information on the side of Player 2 with the total payoff given by the non-normalized sum of stage gains. In the classical examples the value VNV_N of such an NN-stage game is of the order of NN or N\sqrt{N} as NN\to \infty. Our aim is to find what is causing another type of asymptotic behavior of the value VNV_N observed for the discrete version of the financial market model introduced by De Meyer and Saley. For this game Domansky and independently De Meyer with Marino found that VNV_N remains bounded as NN\to\infty and converges to the limit value. This game is almost-fair, i.e., if Player 1 forgets his private information the value becomes zero. We describe a class of almost-fair games having bounded values in terms of an easy-checkable property of the auxiliary non-revealing game. We call this property the piecewise property, and it says that there exists an optimal strategy of Player 2 that is piecewise-constant as a function of a prior distribution pp. Discrete market models have the piecewise property. We show that for non-piecewise almost-fair games with an additional non-degeneracy condition VNV_N is of the order of N\sqrt{N}.

Keywords

Cite

@article{arxiv.1509.01727,
  title  = {On repeated zero-sum games with incomplete information and asymptotically bounded values},
  author = {Fedor Sandomirskiy},
  journal= {arXiv preprint arXiv:1509.01727},
  year   = {2016}
}

Comments

20 pages, many remarks and examples added

R2 v1 2026-06-22T10:49:57.359Z