On maximal ranges of vector measures for subsets and purification of transition probabilities

DOI10.1090/S0002-9939-2011-10860-8zbMath1229.60005arXiv1006.0371MaRDI QIDQ3104471

Peng Dai, Eugene A. Feinberg

Publication date: 13 December 2011

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.0371

zbMATH Keywords

Lyapunov convexity theorempurification of transition probabilitiesmaximal subset

Mathematics Subject Classification ID

Real- or complex-valued set functions (28A10) Probabilistic measure theory (60A10)

Related Items (1)

Extension of Lyapunov’s convexity theorem to subranges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On games with incomplete information and the Dvoretsky-Wald-Wolfowitz theorem with countable partitions
• Purification of measure-valued maps
• On Strongly Equivalent Nonrandomized Transition Probabilities
• On a theorem of Dvoretsky, Wald, and Wolfowitz concerning Liapounov Measures
• An Elementary Proof of Lyapunov's Theorem
• Elimination of Randomization in Certain Problems of Statistics and of the Theory of Games
• Elimination of Randomization in Certain Statistical Decision Procedures and Zero-Sum Two-Person Games

This page was built for publication: On maximal ranges of vector measures for subsets and purification of transition probabilities