Abstract
A coin is tossed repeatedly at a fixed cost per toss. The payoff is the length of the terminal run of heads, less the cost of tossing. Properties of the dynamic programming solution are derived; the exact optimal policy and value of the game are obtained when the game has an infinite horizon, and the rate at which this solution is approached by the sequence of truncated strategies is analyzed numerically.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
