Excerpt from Conservation Laws, Extended Polymatroids and Multi-Armed Bandit Problems: An Unified Approach to Indexable Systems
An interesting distinction, which is not emphasized in the literature, is that examples (1) and (2) above are indexable systems, but they are not in general decomposable systems. Example however, has a more refined structure. It is indexable, but not decomposable. Under discounting, while it is decomposable under the average cost criterion (the cu rule). As already observed, the multi-armed bandit problem is an example of a decomposable system, while example (4) above is also decomposable.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
Shipping:
FREE
From United Kingdom to U.S.A.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book explores the intricate world of stochastic and dynamic scheduling problems, a field that has traditionally relied on complex dynamic programming formulations. The author presents a revolutionary approach that leverages the power of mathematical programming, introducing a novel concept called "generalized conservation laws." By demonstrating the connection between these laws and a type of polyhedron called an "extended polymatroid," the author shows how to analyze and solve various scheduling problems with greater efficiency. This framework unifies several classical problems like multi-armed bandit problems, branching bandits, multiclass queues, and deterministic scheduling problems under a single lens. The author reveals the profound structural properties of these systems, providing a deeper understanding of their indexability and decomposability characteristics. This book offers a fresh perspective on a complex field, making significant contributions to the understanding and optimization of stochastic and dynamic scheduling problems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332245307_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332245307
Quantity: 15 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332245307
Quantity: 15 available