A sequential assignment match process with general renewal arrival times

DOI10.1017/S0269964800003983zbMATH Open1335.60163OpenAlexW2120401163MaRDI QIDQ2805370FDOQ2805370

Authors: Israel David 

Publication date: 11 May 2016

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964800003983

Recommendations

• One-Attribute Sequential Assignment Match Processes in Discrete Time
• Sequential Assignment Match Processes with Arrivals of Candidates and Offers
• Optimal Sequential Assignment
• scientific article; zbMATH DE number 3947985
• scientific article; zbMATH DE number 4091212

Mathematics Subject Classification ID

Renewal theory (60K05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A persistency problem connected with a point process
• Title not available (Why is that?)
• A Sequential Stochastic Assignment Problem
• Optimal Sequential Assignments with Random Arrival Times
• Stochastically maximizing the number of successes in a sequential assignment problem
• Title not available (Why is that?)

Cited In (8)

• Benchmark policies for utility-carrying queues with impatience
• A new algorithm for the multi-item exponentially discounted optimal selection problem.
• A time-dependent best choice problem with costs and random lifetime in organ transplants
• Sequential Assignment Match Processes with Arrivals of Candidates and Offers
• The Stochastic Sequential Assignment Problem With Random Deadlines
• One-Attribute Sequential Assignment Match Processes in Discrete Time
• A new look at organ transplantation models and double matching queues
• Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model

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)