Controlled Markov Chains, Graphs & Hamiltonicity summarizes a line of research that maps certain classical problems of discrete mathematics - such as the Hamiltonian cycle and the Traveling Salesman problems - into convex domains where continuum analysis can be carried out.
Controlled Markov chains, graphs, and Hamiltonicity
โ Scribed by Jerzy A. Filar
- Publisher
- Now Publishers Inc
- Year
- 2007
- Tongue
- English
- Leaves
- 96
- Series
- Foundations and Trends
- Edition
- Now
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
<p><P>The general theory of stochastic processes and the more specialized theory of Markov processes evolved enormously in the second half of the last century. In parallel, the theory of controlled Markov chains (or Markov decision processes) was being pioneered by control engineers and operations r
This book concerns continuous-time controlled Markov chains, also known as continuous-time Markov decision processes. They form a class of stochastic control problems in which a single decision-maker wishes to optimize a given objective function. This book is also concerned with Markov games, where
Presents a number of new and potentially useful self-learning (adaptive) control algorithms and theoretical as well as practical results for both unconstrained and constrained finite Markov chains-efficiently processing new information by adjusting the control strategies directly or indirectly.