Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

One-armed bandit problem for parallel data processing systems

From MaRDI portal
Publication:259910
Jump to:navigation, search

DOI10.1134/S0032946015020088zbMath1333.62033MaRDI QIDQ259910

Alex V. Kolnogorov

Publication date: 18 March 2016

Published in: Problems of Information Transmission (Search for Journal in Brave)



Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) General considerations in statistical decision theory (62C05)


Related Items (1)

Gaussian two-armed bandit and optimization of batch data processing




Cites Work

  • Two-armed bandit problem for parallel data processing systems
  • On Sequential Designs for Maximizing the Sum of $n$ Observations
  • An Asymptotic Minimax Theorem for the Two Armed Bandit Problem
  • Sequential medical trials
  • A Bayes Sequential Sampling Inspection Plan
  • Some aspects of the sequential design of experiments
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: One-armed bandit problem for parallel data processing systems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:259910&oldid=12146968"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki