Optimal assignment of sellers in a store with a random number of clientsviathe Armed Bandit model

DOI10.1051/RO/2017015zbMath1396.49020OpenAlexW2593749999MaRDI QIDQ4578163

Fernando Velasco-Luna, Hugo Cruz-Suárez, V. Vázquez-Guevara

Publication date: 8 August 2018

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2017015

zbMATH Keywords

dynamic programmingMarkov decision processesrandom horizonarmed bandit modelassignment of personal

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Dynamic programming (90C39) Optimal stochastic control (93E20) Markov and semi-Markov decision processes (90C40)

Related Items (2)

A consumption and investment problem via a Markov decision processes approach with random horizon ⋮ Joint invariance principles for random walks with positively and negatively reinforced steps

Cites Work

• Unnamed Item
• Unnamed Item
• Markov decision processes on Borel spaces with total cost and random horizon
• Bayesian and frequentist regression methods
• On the Theory of Dynamic Programming

This page was built for publication: Optimal assignment of sellers in a store with a random number of clientsviathe Armed Bandit model