Geometric convergence of algorithms in gambling theory

S. Ramakrishnan, W. Sudderth

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


In the Dubins and Savage theory of gambling, backward induction provides an algorithm for calculating the optimal return when the gambling problem is leavable. A relatively new algorithm works for nonleavable problems. We show that these algorithms converge geometrically fast for finite gambling problems. Our argument also provides a much simpler proof of convergence for the nonleavable case.

Original languageEnglish (US)
Pages (from-to)568-575
Number of pages8
JournalMathematics of Operations Research
Issue number3
StatePublished - Jan 1 1998


  • Algorithm
  • Finite gambling problem
  • Geometric convergence

ASJC Scopus subject areas

  • Mathematics(all)
  • Computer Science Applications
  • Management Science and Operations Research


Dive into the research topics of 'Geometric convergence of algorithms in gambling theory'. Together they form a unique fingerprint.

Cite this