SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Algorithms for Adversarial Bandit Problems with Multiple Plays · Study

WorkAlgorithms for Adversarial Bandit Problems with Multiple Plays

Uchiya Taishi2010

OA

Workgreen2010

Algorithms for Adversarial Bandit Problems with Multiple Plays

Uchiya Taishi · Atsuyoshi Nakamura · Mineichi Kudo

76 citations·0/0 files stored·Lecture notes in computer science

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 Reinforcement Learning in Robotics Optimization and Search Problems

Abstract

No abstract was published for this record.

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 — 76 citations exist upstream.

References

2002The Nonstochastic Multiarmed Bandit Problem 1987Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards 2007Multi-Armed Bandit Problems 2008Competing in the dark: An efficient algorithm for bandit linear optimization 2007The on-line shortest path problem under partial monitoring 1961Mathematical Methods of Operations Research.1999On the optimality of the Gittins index rule for multi-armed bandits with multiple plays

Cited by

2013Ranked bandits in metric spaces: learning diverse rankings over large document collections 2010Non-Stochastic Bandit Slate Problems 2011Minimax Policies for Combinatorial Prediction Games 2018Budget-Constrained Multi-Armed Bandits With Multiple Plays

Related works

Explore the map →

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

2011Introduction to Online Optimizationarticle · 3 shared references 2009Beating the adaptive bandit with high probabilityother · 3 shared references 2008High-probability regret bounds for bandit online linear optimizationother · 3 shared references 2010Non-Stochastic Bandit Slate Problemsarticle · 3 shared references 2010Bandits Games and Clustering Foundationsthesis · 3 shared references 2014Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Armspreprint · 2 shared references

Details

Year2010

Typeother

Published2010-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations76

Files0 public / 0

ShelfAdvanced Bandit Algorithms Research

Identifiers

doi10.1007/978-3-642-16108-7_30

openalex_workW1569127318

Links

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