Hostname: page-component-7b7567c8c-2jgqx Total loading time: 0 Render date: 2026-11-19T07:51:22.642Z Has data issue: false hasContentIssue false

Optimal Choice of the Best Available Applicant in Full-Information Models

Published online by Cambridge University Press:  14 July 2016

Mitsushi Tamaki*
Affiliation:
Aichi University
*
∗ Postal address: Department of Business Administration, Aichi University, Nagoya Campus, 370 Kurozasa, Miyoshi, Nishikamo, Aichi 470-0296, Japan. Email address: tamaki@vega.aichi-u.ac.jp
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The problem we consider here is a full-information best-choice problem in which n applicants appear sequentially, but each applicant refuses an offer independently of other applicants with known fixed probability 0≤q<1. The objective is to maximize the probability of choosing the best available applicant. Two models are distinguished according to when the availability can be ascertained; the availability is ascertained just after the arrival of the applicant (Model 1), whereas the availability can be ascertained only when an offer is made (Model 2). For Model 1, we can obtain the explicit expressions for the optimal stopping rule and the optimal probability for a given n. A remarkable feature of this model is that, asymptotically (i.e. n→∞), the optimal probability becomes insensitive to q and approaches 0.580 164. The planar Poisson process (PPP) model provides more insight into this phenomenon. For Model 2, the optimal stopping rule depends on the past history in a complicated way and seems to be intractable. We have not solved this model for a finite n but derive, via the PPP approach, a lower bound on the asymptotically optimal probability.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2009