Optimal Stopping and Applications
by Thomas S. Ferguson
Publisher: UCLA 2008
Description:
From the table of contents: Stopping Rule Problems; Finite Horizon Problems; The Existence of Optimal Rules; Applications. Markov Models; Monotone Stopping Rule Problems; Maximizing the Rate of Return; Bandit Problems; Solutions to the Exercises.
Download or read it online for free here:
Download link
(multiple PDF files)
Similar books
The Design of Approximation Algorithms
by D. P. Williamson, D. B. Shmoys - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(16062 views)
by D. P. Williamson, D. B. Shmoys - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(16062 views)
A Practical Guide to Robust Optimization
by Bram L. Gorissen, Ihsan Yanıkoğlu, Dick den Hertog - arXiv
The aim of this paper is to help practitioners to understand robust optimization and to successfully apply it in practice. We provide a brief introduction to robust optimization, and also describe important do's and don'ts for using it in practice.
(7401 views)
by Bram L. Gorissen, Ihsan Yanıkoğlu, Dick den Hertog - arXiv
The aim of this paper is to help practitioners to understand robust optimization and to successfully apply it in practice. We provide a brief introduction to robust optimization, and also describe important do's and don'ts for using it in practice.
(7401 views)
Linear Programming
by Jim Burke - University of Washington
These are notes for an introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig.
(8085 views)
by Jim Burke - University of Washington
These are notes for an introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig.
(8085 views)
Universal Optimization and Its Application
by Alexander Bolonkin - viXra.org
This book describes new method of optimization (''Method of Deformation of Functional'') that has the advantages at greater generality and flexibility as well as the ability to solve complex problems which other methods cannot solve.
(5907 views)
by Alexander Bolonkin - viXra.org
This book describes new method of optimization (''Method of Deformation of Functional'') that has the advantages at greater generality and flexibility as well as the ability to solve complex problems which other methods cannot solve.
(5907 views)