The theory of probability began in the seventeenth century with attempts to calculate the odds of winning in certain games of chance. However, it was not until the middle of the twentieth century that mathematicians de veloped general techniques for maximizing the chances of beating a casino or win
Discrete Gambling and Stochastic Games
✍ Scribed by Ashok P. Maitra, William D. Sudderth (auth.)
- Publisher
- Springer-Verlag New York
- Year
- 1996
- Tongue
- English
- Leaves
- 248
- Series
- Applications of Mathematics 32
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
The theory of probability began in the seventeenth century with attempts to calculate the odds of winning in certain games of chance. However, it was not until the middle of the twentieth century that mathematicians de veloped general techniques for maximizing the chances of beating a casino or winning against an intelligent opponent. These methods of finding op timal strategies for a player are at the heart of the modern theories of stochastic control and stochastic games. There are numerous applications to engineering and the social sciences, but the liveliest intuition still comes from gambling. The now classic work How to Gamble If You Must: Inequalities for Stochastic Processes by Dubins and Savage (1965) uses gambling termi nology and examples to develop an elegant, deep, and quite general theory of discrete-time stochastic control. A gambler "controls" the stochastic pro cess of his or her successive fortunes by choosing which games to play and what bets to make.
✦ Table of Contents
Front Matter....Pages i-xi
Introduction....Pages 1-3
Gambling Houses and the Conservation of Fairness....Pages 5-22
Leavable Gambling Problems....Pages 23-57
Nonleavable Gambling Problems....Pages 59-88
Stationary Families of Strategies....Pages 89-111
Approximation Theorems....Pages 113-170
Stochastic Games....Pages 171-225
Back Matter....Pages 227-244
✦ Subjects
Probability Theory and Stochastic Processes
📜 SIMILAR VOLUMES
<p>There are several techniques to study noncooperative dynamic games, such as dynamic programming and the maximum principle (also called the Lagrange method). It turns out, however, that one way to characterize dynamic potential games requires to analyze inverse optimal control problems, and it is
<p>This unique text for beginning graduate students gives a self-contained introduction to the mathematical properties of stochastics and presents their applications to Markov processes, coding theory, population dynamics, and search engine design. The book is ideal for a newly designed course in an
<p><P>Discrete stochastics is the theory of discrete probability spaces. This undergraduate textbook gives a concise introduction into discrete stochastics in general, and into a variety of typical special topics in this field, such as information theory, fluctuation theory, and semigroups of stocha
Optimal filtering applied to stationary and non-stationary signals provides the most efficient means of dealing with problems arising from the extraction of noise signals. Moreover, it is a fundamental feature in a range of applications, such as in navigation in aerospace and aeronautics, filter pro