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

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

• Optimality results for coupon collection
• COUPON COLLECTING
• Optimization results for a generalized coupon collector problem
• A generalized coupon collector problem
• A variation on the coupon collecting problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• scientific article; zbMATH DE number 3854830 (Why is no real title available?)
• scientific article; zbMATH DE number 5070674 (Why is no real title available?)
• scientific article; zbMATH DE number 5641435 (Why is no real title available?)
• A Sequential Stochastic Assignment Problem
• A Time-dependent Stopping Problem with Application to Live Organ Transplants
• Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem
• Estimating the Mean Cover Time of a Semi-Markov Process via Simulation
• Inequalities: theory of majorization and its applications
• One-Attribute Sequential Assignment Match Processes in Discrete Time
• Optimal Sequential Assignments with Random Arrival Times
• Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
• Sequential Assignment Match Processes with Arrivals of Candidates and Offers
• The Stochastic Sequential Assignment Problem With Random Deadlines

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)