Branching Bandit Processes (Q3415889)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Branching Bandit Processes	scientific article

Statements

scholarly article

0 references

Branching Bandit Processes (English)

0 references

0 references

Probability in the Engineering and Informational Sciences

0 references

publication date

19 January 2007

0 references

MaRDI profile type

MaRDI publication profile

0 references

A Note on M. N. Katehakis' and Y.-R. Chen's Computation of the Gittins Index

0 references

The Multi-Armed Bandit Problem: Decomposition and Computation

0 references

Arm-acquiring bandits

0 references

Sensitivity Analysis for Stochastic Scheduling Problems

0 references

Stochastic scheduling with order constraints

0 references

On Bayesian models in stochastic scheduling

0 references

Linear Programming for Finite State Multi-Armed Bandit Problems

0 references

Extensions of the multiarmed bandit problem: The discounted case

0 references

Scheduling for Minimum Total Loss Using Service Time Distributions

0 references

0 references

A hamiltonian approach to optimal stochastic resource allocation

0 references

Multiple feedback at a single-server station

0 references

Time-Sharing Service Systems. II

0 references

Time-Sharing Service Systems. I

0 references

Multi-armed bandits with discount factor near one: The Bernoulli case

0 references

Identifiers

zbMATH Open document ID

0 references

10.1017/S0269964800000826

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3415889

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3415889&oldid=34912532"