Sold out

Conservation Laws, Extended Polymatroids and Multi-Armed Bandit Problems - An Unified Approach to Indexable Systems (Classic Reprint)

English · Paperback / Softback

Description

Read more

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 cit. 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.

Product details

Authors Dimitris Bertsimas
Publisher Forgotten Books
 
Languages English
Product format Paperback / Softback
Released 31.08.2015
 
No. of pages 64
Dimensions 152 mm x 229 mm x 3 mm
Weight 100 g
Subjects Humanities, art, music > History
Natural sciences, medicine, IT, technology > Mathematics > Analysis

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.