Name
Abstract | ||
|---|---|---|
<P>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.</P> |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1287/moor.23.3.568 | Math. Oper. Res. |
Keywords | DocType | Volume |
geometric convergence,finite gambling problem,gambling problem,algorithms converge geometrically,simpler proof,gambling theory,savage theory,optimal return,new algorithm work,nonleavable problem,nonleavable case | Journal | 23 |
Issue | ISSN | Citations |
3 | 0364-765X | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Ramakrishnan | 1 | 3 | 2.44 |
| William D. Sudderth | 2 | 62 | 16.34 |