One-Attribute Sequential Assignment Match Processes in Discrete Time
From MaRDI portal
Recommendations
- A sequential assignment match process with general renewal arrival times
- Sequential Assignment Match Processes with Arrivals of Candidates and Offers
- scientific article; zbMATH DE number 3947985
- On optimal attraction in discrete-event processes
- Sequential entry in one-to-one matching markets
- scientific article; zbMATH DE number 3999704
- Sequential stochastic assignment problem with time-dependent random success rates
- Stochastic non-bipartite matching models and order-independent loss queues
- Asymptotics of the optimum in discrete sequential assignment
Cited in
(12)- Dynamic allocation of stochastically-arriving flexible resources to random streams of objects with application to kidney cross-transplantation
- Triply stochastic sequential assignment problem with the uncertainty in worker survival
- Benchmark policies for utility-carrying queues with impatience
- A double-ended queueing model for dynamic allocation of live organs based on a best-fit criterion
- A sequential assignment match process with general renewal arrival times
- Stochastic sequential assignment problem with arrivals
- Sequential Assignment Match Processes with Arrivals of Candidates and Offers
- A generalized coupon collecting model as a parsimonious optimal stochastic assignment model
- Technical note -- A stochastic assignment problem with unknown eligibility probabilities
- Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
- Location of organ procurement and distribution organisation decisions and their impact on kidney allocations: a developing country perspective
- Applications of fluid models in service operations management
This page was built for publication: One-Attribute Sequential Assignment Match Processes in Discrete Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868808)
