Branching bandits and Klimov's problem : achievable region and side constraints

Home
→
Laboratory for Information and Decision Systems (LIDS)
→
LIDS Technical Reports
→
View Item

Branching bandits and Klimov's problem : achievable region and side constraints

Author: Bertsimas, Dimitris; Paschalidis, Ioannis Ch.; Tsitsiklis, John N.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.

Citable URI: http://hdl.handle.net/1721.1/3367

Publisher: Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]

Date Issued: 1994

Description:

Includes bibliographical references (p. 22-24).

URI: http://hdl.handle.net/1721.1/3367

Series/Report no.: LIDS-P ; 2242

Keywords: TK7855.M41 E3845 no.2242

Show full item metadata

Files in this item

Name	Size	Format	Description
P-2242-30457231.pdf	1.790Mb	PDF

This item appears in the following Collection(s)

LIDS Technical Reports
The Laboratory for Information and Decision Systems Technical Report Series

Browse

All of DSpace@MIT
This Collection
- By Issue Date
- Authors
- Titles
- Subjects

My Account

MIT-Mirage

Branching bandits and Klimov's problem : achievable region and side constraints

Research and Teaching Output of the MIT Community

Branching bandits and Klimov's problem : achievable region and side constraints

Files in this item

This item appears in the following Collection(s)

Browse

All of DSpace@MIT

This Collection

My Account