Abstract
A gambling house Γ has a property like that of a stationary Markov chain. Namely, the set of gambles Γ(x n ) available at the nth play depends only on the value of the current state x n and not on any past states. So it is natural to ask whether it is harmful for a gambler to ignore the past when selecting gambles.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Maitra, A.P., Sudderth, W.D. (1996). Stationary Families of Strategies. In: Discrete Gambling and Stochastic Games. Applications of Mathematics, vol 32. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4002-0_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4002-0_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8467-3
Online ISBN: 978-1-4612-4002-0
eBook Packages: Springer Book Archive