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.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700