Learning in the Repeated Secretary Problem

EC, 2017.

Cited by: 2|Bibtex|Views9|Links
EI

Abstract:

In the classical secretary problem, one attempts to find the maximum of an unknown and unlearnable distribution through sequential search. In many real-world searches, however, distributions are not entirely unknown and can be learned through experience. To investigate learning in such a repeated secretary problem we conduct a large-scale...More

Code:

Data:

Your rating :
0

 

Tags
Comments