Skip to main content
  • Book
  • © 2021

Foundations of Average-Cost Nonhomogeneous Controlled Markov Chains

  • Presents a comprehensive methodology for the performance optimization of time-nonhomogeneous Markov chains
  • Introduces the concept of confluencity, showing how it is fundamental to performance optimization and state classification
  • Tackles various long-standing issues related to time-nonhomogeneous Markov chains.
  • Motivates new research ideas future work in Markov system optimization

Part of the book series: SpringerBriefs in Electrical and Computer Engineering (BRIEFSELECTRIC)

Part of the book sub series: SpringerBriefs in Control, Automation and Robotics (BRIEFSCONTROL)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (5 chapters)

  1. Front Matter

    Pages i-viii
  2. Introduction

    • Xi-Ren Cao
    Pages 1-12
  3. Confluencity and State Classification

    • Xi-Ren Cao
    Pages 13-27
  4. The Nth-Bias and Blackwell Optimality

    • Xi-Ren Cao
    Pages 79-108
  5. Back Matter

    Pages 109-120

About this book

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.

Reviews

“The book presents a complete and interesting analysis for the optimization of TNHMCs with long-run average performance.” (Raúl Montes-de-Oca, Mathematical Reviews, March, 2022)

Authors and Affiliations

  • Department of Automation, Shanghai Jiao Tong University, Shanghai, China

    Xi-Ren Cao

About the author

Professor Xi-Ren Cao gained his B.S. in 1967 from the University of Sciences and Technology of China, and his M.S. and Ph.D. from Harvard University, in 1982 and 1984, respectively. He has worked in numerous industrial, teaching, and research positions since then, and is now a Professor Emeritus, The Hong Kong University of Science and Technology. He has acted as an Industry Consultant, was Editor-in-Chief of Discrete Event Dynamic Systems: Theory and Applications for 9 years, and is a Fellow of IFAC and the IEEE. He has published 125 peer-reviewed journal papers, 12 invited book chapters, and four books. 

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access