This article considers a problem arising from a two-player game based on the classical
secretary problem. First, Player 1 selects one object from a sequence as in the secretary …

We investigate the hiring problem where a sequence of applicants is sequentially
interviewed, and a decision on whether to hire an applicant is immediately made based on …

Expected duration of the no-information minimum rank problem - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

We consider optimal stopping problems, in which a sequence of independent random
variables is drawn from a known continuous density. The objective of such problems is to …

The present article is an essay about mathematical intuition and Artificial intelligence (AI),
followed by a guided excursion to Robbins' Problem of Optimal Stopping. The latter is still …

In this paper, a new variant of the classic secretary problem is studied, in which the
interviewer has a look-ahead privilege to observe partial future candidates before making a …

The classical secretary problem involves sequentially interviewing a pool of N applicants
with the aim of hiring exactly the best one in the pool–nothing less is good enough. The …

Motivated by matching platforms that match agents in a centralized manner, we study
dynamic two-sided matching in a setting where both customers (demand) and service …

Given a finite sequence of events and a well-defined notion of events being interesting, the
Odds-theorem (Bruss (2000)) gives an online strategy to stop on the last interesting event. It …

We consider a sequential search over a group of similar alternatives. The individual value of
an alternative contains two components, an observable utility and an idiosyncratic value …