Iterated full information secretary problem

Małgorzata Kuchta ()
Additional contact information
Małgorzata Kuchta: Wrocław University of Science and Technology

Mathematical Methods of Operations Research, 2017, vol. 86, issue 2, No 2, 277-292

Abstract: Abstract We consider a full information best-choice problem where an administrator who has only one on-line choice in m consecutive searches has to choose the best candidate in one of them.

Keywords: Monotone case; Secretary problem; Full information; Best choice; Optimal stopping time; 60G40 (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s00186-017-0594-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:86:y:2017:i:2:d:10.1007_s00186-017-0594-0

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-017-0594-0

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().