Bilateral Secretary Problem Recognizing the Maximum or the Second Maximum of a Sequence

DOI10.1080/02522667.1990.10699013zbMath0712.90102OpenAlexW1977083245MaRDI QIDQ3197648

Katsunori Ano

Publication date: 1990

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1990.10699013

zbMATH Keywords

bilateral secretary problemoptimal stopping policies

Mathematics Subject Classification ID

2-person games (91A05) Stopping times; optimal stopping problems; gambling theory (60G40) Stochastic games, stochastic differential games (91A15)

Cites Work

• Recognizing both the maximum and the second maximum of a sequence
• Unnamed Item

This page was built for publication: Bilateral Secretary Problem Recognizing the Maximum or the Second Maximum of a Sequence