One-attribute sequential assignment match processes in discrete time.

Israel David, Uri Yechiali

Research output: Contribution to journalArticlepeer-review

Abstract

We consider a sequential matching problem where M offers arrive in a random stream and are to he sequentially assigned to N waiting candidates. Each candidate, as well as each offer, is characterized by a random attribute drawn from a known discrete-valued probability distribution function. An assignment of an offer to a candidate yields a (nominal) reward R > 0 if they match, and a smaller reward r &les R if they do not. Future rewards are discounted at a rate 0 ⩽ α1. We study several cases with various assumptions on the problem parameters and on the assignment regime and derive optimal policies that maximize the total (discounted) reward. The model is related to the problem of donor-recipient assignment in live organ transplants, studied in an earlier work.
Original languageEnglish
Pages (from-to)879-884
Number of pages6
JournalOperations Research
Volume43
Issue number5
DOIs
StatePublished - 1 Sep 1995

Keywords

  • Probability theory
  • Distribution (Probability theory)
  • Research
  • Sequential analysis
  • Characteristic functions
  • Transplantation of organs, tissues, etc.

Fingerprint

Dive into the research topics of 'One-attribute sequential assignment match processes in discrete time.'. Together they form a unique fingerprint.

Cite this