On games with incomplete information and the Dvoretsky-Wald-Wolfowitz theorem with countable partitions
It has remained an open question as to whether the results of Milgrom-Weber [Milgrom, P.R., Weber, R.J., 1985. Distributional strategies for games with incomplete information. Mathematics of Operations Research 10, 619-632] are valid for action sets with a countably infinite number of elements without additional assumptions on the abstract measure space of information. In this paper, we give an affirmative answer to this question as a consequence of an extension of a theorem of Dvoretzky, Wald and Wolfowitz (henceforth DWW) due to Edwards [Edwards, D.A., 1987. On a theorem of Dvoretsky, Wald and Wolfowitz concerning Liapunov measures. Glasgow Mathematical Journal 29, 205-220]. We also present a direct elementary proof of the DWW theorem and its extension, one that may have an independent interest.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Drew Fudenberg & Jean Tirole, 1991. "Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061414, January.
- Yu, Haomiao & Zhang, Zhixiang, 2007. "Pure strategy equilibria in games with countable actions," Journal of Mathematical Economics, Elsevier, vol. 43(2), pages 192-200, February.
- Khan, M. Ali & Rath, Kali P. & Sun, Yeneng, 1999. "On a private information game without pure strategy equilibria1," Journal of Mathematical Economics, Elsevier, vol. 31(3), pages 341-359, April.
- Khan, M. Ali & Yeneng, Sun, 1995. "Pure strategies in games with private information," Journal of Mathematical Economics, Elsevier, vol. 24(7), pages 633-653.
- M. Khan & Kali Rath & Yeneng Sun, 2006. "The Dvoretzky-Wald-Wolfowitz theorem and purification in atomless finite-action games," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(1), pages 91-104, April.