A Generalized Bandit Problem

Unknown author

35 citations0/0 files storedJournal of the Royal Statistical Society Series B (Statistical Methodology)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Bandit Algorithms Research Simulation Techniques and Applications Optimization and Search Problems

Abstract

Summary A multi-armed bandit problem is investigated in which rewards obtained from pulls of any arm depend on the states of the other arms, as well as on the state of the arm pulled. A Dynamic Allocation Index is defined for this class of problems, and it is shown that this leads to optimal policies.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 35 citations exist upstream.

References

1979Bandit Processes and Dynamic Allocation Indices 1971Introduction to stochastic control 1977Scheduling, Queues and Dynamic Allocation Indices

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.