Optimal dynamic resource allocation to prevent defaults
From MaRDI portal
Publication:1694773
DOI10.1016/j.orl.2016.04.008zbMath1380.90278OpenAlexW2343114244MaRDI QIDQ1694773
M. Erausquin, Eva Ferreira, Peter Jacko, Urtzi Ayesta
Publication date: 6 February 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/79300/1/ORL_report.pdf
Markov decision processesmulti-armed bandit problemdefault risk managementdynamic resource allocation policies
Markov and semi-Markov decision processes (90C40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
A centre–free approach for resource allocation with lower bounds, Optimal dynamic resource allocation to prevent defaults, Modelling and solving resource allocation problems via a dynamic programming approach, Allocating resources via price management systems: a dynamic programming-based approach
Cites Work
- Unnamed Item
- Unnamed Item
- A Bayesian approach to the triage problem with imperfect classification
- Learning about variable demand in the long run
- Dynamic priority allocation via restless bandit marginal productivity indices
- Optimal dynamic resource allocation to prevent defaults
- Index policies for the maintenance of a collection of machines by a set of repairmen
- Optimal selection of obsolescence mitigation strategies using a restless bandit model
- Multi‐Armed Bandit Allocation Indices
- Optimal Search for the Best Alternative
- Funding Criteria for Research, Development, and Exploration Projects
- Strategic Experimentation
- Strategic Experimentation with Exponential Bandits