A capacitability theorem in measurable gambling theory

A capacitability theorem in measurable gambling theory

0.00 Avg rating0 Votes
Article ID: iaor19931467
Country: United States
Volume: 333
Issue: 1
Start Page Number: 221
End Page Number: 249
Publication Date: Sep 1992
Journal: Transactions of the American Mathematical Society
Authors: , ,
Abstract:

A player in a measurable gambling house ¦) defined on a Polish state space X has available, for each x∈X, the collection Σ(x) of possible distributions σ for the stochastic process x1,x2,....of future states. If the object is to control the process so that it will lie in an analytic subset A of H=X×X×ëëë, then the player’s optimal reward is M(A)(x)=sup∈σ(A):σ∈Σ(x)∈. The operator M(ë)(x) is shown to be regular in the sense that M(A)(x)=infM(∈τ∈∈∈)(x), where the infimum is over Borel stopping times τ such that A⊆∈τ∈∈∈. A consequence of this regularity property is that the value of M(A)(x) is unchanged if, as in the gambling theory of Dubins and Savage, the player is allowed to use nonmeasurable strategies. This last result is seen to hold for bounded, Borel measurable payoff functions including that of Dubins and Savage.

Reviews

Required fields are marked *. Your email address will not be published.