Results 191 to 200 of about 357 (209)
Some of the next articles are maybe not open access.

The Secretary Problem with an Unknown Number of Options

Operations Research, 1981
A method of selecting the best element from a random sequence of unknown length is investigated. By assuming that the arrival times of the elements are independent identically distributed (i.i.d.) exponential random variables, a procedure is established that maximizes the probability of selecting the best element.
openaire   +2 more sources

Strong Algorithms for the Ordinal Matroid Secretary Problem

Mathematics of Operations Research, 2021
VÍCTOR Verdugo, JOSÉ A Soto
exaly  

Optimal Expected Rank in a Two-Sided Secretary Problem

Operations Research, 2007
Kimmo Eriksson, Pontus Strimling
exaly  

A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem

Mathematics of Operations Research, 2018
Moran Feldman   +2 more
exaly  

The secretary problem on an unknown poset

Random Structures and Algorithms, 2013
Robert Morris
exaly  

A satisficing policy of the secretary problem: theory and simulation

Communications in Statistics - Theory and Methods, 2020
Xinlin Wu
exaly  

Submodular secretary problem and extensions

ACM Transactions on Algorithms, 2013
Mohammad Hajiaghayi
exaly  

Home - About - Disclaimer - Privacy