A generalized coupon collecting model as a parsimonious optimal stochastic assignment model

DOI10.1007/s10479-012-1086-5zbMath1274.90203OpenAlexW2140858704MaRDI QIDQ378733

David Teng Wu, Sheldon M. Ross

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

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (5)

Asymptotic analysis for multi-objective sequential stochastic assignment problems ⋮ TWO-CLASS ROUTING WITH ADMISSION CONTROL AND STRICT PRIORITIES ⋮ Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities ⋮ BUDGET ALLOCATIONS IN OPERATIONAL RISK MANAGEMENT ⋮ Two poisson limit theorems for the coupon collector’s problem with group drawings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Stochastic Sequential Assignment Problem With Random Deadlines
• Sequential Assignment Match Processes with Arrivals of Candidates and Offers
• A Time-dependent Stopping Problem with Application to Live Organ Transplants
• Optimal Sequential Assignments with Random Arrival Times
• 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
• A Sequential Stochastic Assignment Problem
• Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem
• Inequalities: theory of majorization and its applications

This page was built for publication: A generalized coupon collecting model as a parsimonious optimal stochastic assignment model