Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities
From MaRDI portal
Publication:4994154
DOI10.1287/OPRE.2020.1988zbMath1478.90053OpenAlexW3092655813MaRDI QIDQ4994154
Sheldon M. Ross, Gideon Weiss, Zheng-Yu Zhang
Publication date: 17 June 2021
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2020.1988
Stochastic programming (90C15) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- A generalized coupon collecting model as a parsimonious optimal stochastic assignment model
- Probabilistic resource allocation in heterogeneous distributed systems with random failures
- Dynamic search models with multiple items
- Technical Note—Stochastic Sequential Decision-Making with a Random Number of Jobs
- The Stochastic Sequential Assignment Problem With Random Deadlines
- Structural Properties of Stochastic Dynamic Programs
- Optimal Sequential Assignments with Random Arrival Times
- Dynamic server allocation to parallel queues with randomly varying connectivity
- A stochastic assignment problem
- One-Attribute Sequential Assignment Match Processes in Discrete Time
- Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
- A Sequential Stochastic Assignment Problem
- Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem
This page was built for publication: Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities