A sequential assignment match process with general renewal arrival times
From MaRDI portal
Publication:2805370
Recommendations
Cites work
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 3906232 (Why is no real title available?)
- scientific article; zbMATH DE number 3591262 (Why is no real title available?)
- scientific article; zbMATH DE number 3231480 (Why is no real title available?)
- A Sequential Stochastic Assignment Problem
- A persistency problem connected with a point process
- Optimal Sequential Assignments with Random Arrival Times
- Stochastically maximizing the number of successes in a sequential assignment problem
Cited in
(8)- A time-dependent best choice problem with costs and random lifetime in organ transplants
- Benchmark policies for utility-carrying queues with impatience
- One-Attribute Sequential Assignment Match Processes in Discrete Time
- Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
- A new look at organ transplantation models and double matching queues
- A new algorithm for the multi-item exponentially discounted optimal selection problem.
- Sequential Assignment Match Processes with Arrivals of Candidates and Offers
- The Stochastic Sequential Assignment Problem With Random Deadlines
This page was built for publication: A sequential assignment match process with general renewal arrival times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805370)
