Regret bounds for restless Markov bandits

Ronald Ortner, Daniil Ryabko, Peter Auer, Rémi Munos

Open source

DOI: 10.1016/j.tcs.2014.09.026
Published: 2014-11
Container: Theoretical Computer Science
Publisher: Elsevier BV
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1016/j.tcs.2014.09.026,
  title = {Regret bounds for restless Markov bandits},
  author = {Ronald Ortner and Daniil Ryabko and Peter Auer and Rémi Munos},
  year = {2014},
  journal = {Theoretical Computer Science},
  doi = {10.1016/j.tcs.2014.09.026},
  url = {https://doi.org/10.1016/j.tcs.2014.09.026}
}

RIS

TY  - JOUR
TI  - Regret bounds for restless Markov bandits
AU  - Ronald Ortner
AU  - Daniil Ryabko
AU  - Peter Auer
AU  - Rémi Munos
PY  - 2014
JO  - Theoretical Computer Science
DO  - 10.1016/j.tcs.2014.09.026
UR  - https://doi.org/10.1016/j.tcs.2014.09.026
ER  -

APA

Ortner, R., Ryabko, D., Auer, P., & Munos, R. (2014). Regret bounds for restless Markov bandits. Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2014.09.026

Source records

crossref · retrieved 2026-09-25T21:12:49.231Z