Indexed metadata

Linear Programming for Finite State Multi-Armed Bandit Problems

Yih Ren Chen, Michael N. Katehakis

Source record

Source: Crossref

Published: Feb 1, 1986

DOI: 10.1287/moor.11.1.180

Open original source ↗

Source abstract

We consider the multi-armed bandit problem. We show that when the state space is finite the computation of the dynamic allocation indices can be handled by linear programming methods.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Linear Programming for Finite State Multi-Armed Bandit Problems — Mathematical Frontier Network