Geometric convergence of algorithms in gambling theory

S. Ramakrishnan; W. Sudderth

doi:10.1287/moor.23.3.568

Geometric convergence of algorithms in gambling theory

S. Ramakrishnan, W. Sudderth

Mathematics

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	568-575
Number of pages	8
Journal	Mathematics of Operations Research
Volume	23
Issue number	3
DOIs	https://doi.org/10.1287/moor.23.3.568
State	Published - Jan 1 1998

Keywords

Algorithm
Finite gambling problem
Geometric convergence

ASJC Scopus subject areas

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

Access to Document

10.1287/moor.23.3.568

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

Cite this

@article{add6e957c1624ed3970ee0bbc00091b5,

title = "Geometric convergence of algorithms in gambling theory",

abstract = "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.",

keywords = "Algorithm, Finite gambling problem, Geometric convergence",

author = "S. Ramakrishnan and W. Sudderth",

year = "1998",

month = jan,

day = "1",

doi = "10.1287/moor.23.3.568",

language = "English (US)",

volume = "23",

pages = "568--575",

journal = "Mathematics of Operations Research",

issn = "0364-765X",

publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",

number = "3",

}

TY - JOUR

T1 - Geometric convergence of algorithms in gambling theory

AU - Ramakrishnan, S.

AU - Sudderth, W.

PY - 1998/1/1

Y1 - 1998/1/1

N2 - 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.

AB - 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.

KW - Algorithm

KW - Finite gambling problem

KW - Geometric convergence

UR - http://www.scopus.com/inward/record.url?scp=0032131205&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032131205&partnerID=8YFLogxK

U2 - 10.1287/moor.23.3.568

DO - 10.1287/moor.23.3.568

M3 - Article

AN - SCOPUS:0032131205

VL - 23

SP - 568

EP - 575

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

SN - 0364-765X

IS - 3

ER -

Geometric convergence of algorithms in gambling theory

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this