Foundations of Average-Cost Nonhomogeneous Controlled Markov Chains

Foundations of Average-Cost Nonhomogeneous Controlled Markov Chains
Author: Xi-Ren Cao
Publisher:
Total Pages: 0
Release: 2021
Genre:
ISBN: 9783030566791

This Springer brief addresses the challenges encountered in the study of the optimization of time-nonhomogeneous Markov chains. It develops new insights and new methodologies for systems in which concepts such as stationarity, ergodicity, periodicity and connectivity do not apply. This brief introduces the novel concept of confluencity and applies a relative optimization approach. It develops a comprehensive theory for optimization of the long-run average of time-nonhomogeneous Markov chains. The book shows that confluencity is the most fundamental concept in optimization, and that relative optimization is more suitable for treating the systems under consideration than standard ideas of dynamic programming. Using confluencity and relative optimization, the author classifies states as confluent or branching and shows how the under-selectivity issue of the long-run average can be easily addressed, multi-class optimization implemented, and Nth biases and Blackwell optimality conditions derived. These results are presented in a book for the first time and so may enhance the understanding of optimization and motivate new research ideas in the area.

Foundations of Average-Cost Nonhomogeneous Controlled Markov Chains

Foundations of Average-Cost Nonhomogeneous Controlled Markov Chains
Author: Xi-Ren Cao
Publisher: Springer Nature
Total Pages: 120
Release: 2020-09-09
Genre: Technology & Engineering
ISBN: 3030566781

This Springer brief addresses the challenges encountered in the study of the optimization of time-nonhomogeneous Markov chains. It develops new insights and new methodologies for systems in which concepts such as stationarity, ergodicity, periodicity and connectivity do not apply. This brief introduces the novel concept of confluencity and applies a relative optimization approach. It develops a comprehensive theory for optimization of the long-run average of time-nonhomogeneous Markov chains. The book shows that confluencity is the most fundamental concept in optimization, and that relative optimization is more suitable for treating the systems under consideration than standard ideas of dynamic programming. Using confluencity and relative optimization, the author classifies states as confluent or branching and shows how the under-selectivity issue of the long-run average can be easily addressed, multi-class optimization implemented, and Nth biases and Blackwell optimality conditions derived. These results are presented in a book for the first time and so may enhance the understanding of optimization and motivate new research ideas in the area.

Selected Topics On Continuous-time Controlled Markov Chains And Markov Games

Selected Topics On Continuous-time Controlled Markov Chains And Markov Games
Author: Tomas Prieto-rumeau
Publisher: World Scientific
Total Pages: 292
Release: 2012-03-16
Genre: Mathematics
ISBN: 1908977639

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 two decision-makers (or players) try to optimize their own objective function. Both decision-making processes appear in a large number of applications in economics, operations research, engineering, and computer science, among other areas.An extensive, self-contained, up-to-date analysis of basic optimality criteria (such as discounted and average reward), and advanced optimality criteria (e.g., bias, overtaking, sensitive discount, and Blackwell optimality) is presented. A particular emphasis is made on the application of the results herein: algorithmic and computational issues are discussed, and applications to population models and epidemic processes are shown.This book is addressed to students and researchers in the fields of stochastic control and stochastic games. Moreover, it could be of interest also to undergraduate and beginning graduate students because the reader is not supposed to have a high mathematical background: a working knowledge of calculus, linear algebra, probability, and continuous-time Markov chains should suffice to understand the contents of the book.

Controlled Markov Chains, Graphs and Hamiltonicity

Controlled Markov Chains, Graphs and Hamiltonicity
Author: Jerzy A. Filar
Publisher: Now Publishers Inc
Total Pages: 95
Release: 2007
Genre: Mathematics
ISBN: 1601980884

"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. (Mathematics)

Finite Markov Processes and Their Applications

Finite Markov Processes and Their Applications
Author: Marius Iosifescu
Publisher: Courier Corporation
Total Pages: 305
Release: 2014-07-01
Genre: Mathematics
ISBN: 0486150585

A self-contained treatment of finite Markov chains and processes, this text covers both theory and applications. Author Marius Iosifescu, vice president of the Romanian Academy and director of its Center for Mathematical Statistics, begins with a review of relevant aspects of probability theory and linear algebra. Experienced readers may start with the second chapter, a treatment of fundamental concepts of homogeneous finite Markov chain theory that offers examples of applicable models. The text advances to studies of two basic types of homogeneous finite Markov chains: absorbing and ergodic chains. A complete study of the general properties of homogeneous chains follows. Succeeding chapters examine the fundamental role of homogeneous infinite Markov chains in mathematical modeling employed in the fields of psychology and genetics; the basics of nonhomogeneous finite Markov chain theory; and a study of Markovian dependence in continuous time, which constitutes an elementary introduction to the study of continuous parameter stochastic processes.

Cont Markov Chains

Cont Markov Chains
Author: Borkar
Publisher: CRC Press
Total Pages: 196
Release: 1991-04-30
Genre: Mathematics
ISBN: 9780582068216

Provides a novel treatment of many problems in controlled Markov chains based on occupation measures and convex analysis. Includes a rederivation of many classical results, a general treatment of the ergodic control problems and an extensive study of the asymptotic behavior of the self-tuning adaptive controller and its variant, the Kumar-Becker-Lin scheme. Also includes a novel treatment of some multiobjective control problems, inaccessible to traditional methods. Annotation copyrighted by Book News, Inc., Portland, OR

Markov Chains

Markov Chains
Author: D. Revuz
Publisher: Elsevier
Total Pages: 389
Release: 2008-07-15
Genre: Mathematics
ISBN: 0080880223

This is the revised and augmented edition of a now classic book which is an introduction to sub-Markovian kernels on general measurable spaces and their associated homogeneous Markov chains. The first part, an expository text on the foundations of the subject, is intended for post-graduate students. A study of potential theory, the basic classification of chains according to their asymptotic behaviour and the celebrated Chacon-Ornstein theorem are examined in detail. The second part of the book is at a more advanced level and includes a treatment of random walks on general locally compact abelian groups. Further chapters develop renewal theory, an introduction to Martin boundary and the study of chains recurrent in the Harris sense. Finally, the last chapter deals with the construction of chains starting from a kernel satisfying some kind of maximum principle.