Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-28T01:22:38.728Z Has data issue: false hasContentIssue false
  • English
  • Français

Sequential Assignment Match Processes with Arrivals of Candidates and Offers

Published online by Cambridge University Press:  27 July 2009

Israel David  and
Uri Yechiali
Israel David
Affiliation:
Department of Mathematics and Computer ScienceBen-Gurion University of the Negev, Beer-Sheva 84105, Israel
Uri Yechiali
Affiliation:
Department of Statistics The Raymond and Beverley Sackler Faculty of Exact SciencesTel Aviv University, Tel Aviv 69978, Israel
Get access Rights & Permissions [Opens in a new window]

Abstract

An infinite random stream of ordered pairs arrives sequentially in discrete time. A pair consists of a “candidate” and an “offer,” each of which is either of type I (with probability p) or of type II (with probability q = 1 – p). Offers are to be assigned to candidates, yielding a reward R > 0 if they match in type, or a smaller reward 0 ≤ r ≤ R if not. An arriving candidate resides in the system until it is assigned, whereas an arriving offer is either assigned immediately to one of the waiting candidates or lost forever. We show that the optimal long-term average reward is R, independent of the population proportion p and the “second prize” r, and that the optimal average reward policy is to assign only a match. Optimal policies for discounted and finite horizon models are also derived.

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 4 , Issue 4 , October 1990 , pp. 413 - 430
Copyright
Copyright © Cambridge University Press 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Cox, D.R. (1962). Renewal theory. London: Methuen.Google Scholar
David, I. & Yechiali, U. (1985). A time-dependent stopping problem with application to live-organ transplants. Operations Research 33: 491–504.CrossRefGoogle ScholarPubMed
David, I. & Yechiali, U. (1989). Discrete-time finite-state sequential assignment match processes. Technical Report, Dept. of Statistics, Tel Aviv University.Google Scholar
David, I. & Yechiali, U. (1989). Continuous-time finite-state sequential assignment match processes. Technical Report, Dept. of Statistics, Tel Aviv University.Google Scholar
Howard, R.A. (1960). Dynamic programming and Markov processes. Cambridge, Mass.: MIT Press.Google Scholar
Ross, S.M. (1983). Introduction to stochastic dynamic programming. New York: Academic Press.Google Scholar