# Selecting with History

## TL;DR

This paper introduces a new selection problem called 'Selecting with History' that extends the secretary problem by incorporating historical data, and proposes a strategy with its success probability analyzed asymptotically.

## Contribution

It defines the 'Selecting with History' problem, extending classical secretary problem frameworks, and provides a strategy with success probability analysis for large sequences.

## Key findings

- Proposed a new selection strategy for the problem.
- Calculated success probability in the large sequence limit.
- Extended secretary problem to include historical information.

## Abstract

We define a new selection problem, \emph{Selecting with History}, which extends the secretary problem to a setting with historical information. We propose a strategy for this problem and calculate its success probability in the limit of a large sequence.