Arbeitspapier

Approximate Results for a Generalized Secretary Problem

A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is bigger than or equal to 1 is a preassigned number. It is known, already for a long time, that for the optimal policy one needs to compute b position thresholds, for instance via backwards induction. In this paper we study approximate policies, that use just a single or a double position threshold, albeit in conjunction with a level rank. We give exact and asymptotic (as n goes to infinity) results, which show that the double-level policy is an extremely accurate approximation.

Language
Englisch

Bibliographic citation
Series: Tinbergen Institute Discussion Paper ; No. 10-092/4

Classification
Wirtschaft
Mathematical Methods; Programming Models; Mathematical and Simulation Modeling: General
Optimization Techniques; Programming Models; Dynamic Analysis
Subject
Secretary Problem
Dynamic Programming
Approximate Policies
Mathematische Optimierung
Suchtheorie
Theorie

Event
Geistige Schöpfung
(who)
Dietz, Chris
van der Laan, Dinard
Ridder, Ad
Event
Veröffentlichung
(who)
Tinbergen Institute
(where)
Amsterdam and Rotterdam
(when)
2010

Handle
Last update
10.03.2025, 11:43 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Arbeitspapier

Associated

  • Dietz, Chris
  • van der Laan, Dinard
  • Ridder, Ad
  • Tinbergen Institute

Time of origin

  • 2010

Other Objects (12)