A generalized coupon collecting model as a parsimonious optimal stochastic assignment model
From MaRDI portal
Publication:378733
DOI10.1007/S10479-012-1086-5zbMATH Open1274.90203OpenAlexW2140858704MaRDI QIDQ378733FDOQ378733
Authors: Sheldon M. Ross, David Teng Wu
Publication date: 12 November 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1086-5
Recommendations
Cites Work
- Inequalities: theory of majorization and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Time-dependent Stopping Problem with Application to Live Organ Transplants
- A Sequential Stochastic Assignment Problem
- Optimal Sequential Assignments with Random Arrival Times
- Title not available (Why is that?)
- The Stochastic Sequential Assignment Problem With Random Deadlines
- Sequential Assignment Match Processes with Arrivals of Candidates and Offers
- One-Attribute Sequential Assignment Match Processes in Discrete Time
- Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
- Estimating the Mean Cover Time of a Semi-Markov Process via Simulation
- Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem
Cited In (8)
- Budget allocations in operational risk management
- On the optimality of coupon books
- Two Poisson limit theorems for the coupon collector's problem with group drawings
- Asymptotic analysis for multi-objective sequential stochastic assignment problems
- Optimal sampling strategies in the coupon collector's problem with unknown population size
- Two-class routing with admission control and strict priorities
- Technical note -- A stochastic assignment problem with unknown eligibility probabilities
- A stochastic assignment problem
This page was built for publication: A generalized coupon collecting model as a parsimonious optimal stochastic assignment model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378733)