A Sequential Assignment Match Process with General Renewal Arrival Times

DOI10.1017/S0269964800003983zbMath1335.60163OpenAlexW2120401163MaRDI QIDQ2805370

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

Mathematics Subject Classification ID

Renewal theory (60K05)

Related Items (3)

Benchmark policies for utility-carrying queues with impatience ⋮ A new algorithm for the multi-item exponentially discounted optimal selection problem. ⋮ A NEW LOOK AT ORGAN TRANSPLANTATION MODELS AND DOUBLE MATCHING QUEUES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal Sequential Assignments with Random Arrival Times
• A persistency problem connected with a point process
• A Sequential Stochastic Assignment Problem
• Stochastically maximizing the number of successes in a sequential assignment problem

This page was built for publication: A Sequential Assignment Match Process with General Renewal Arrival Times