Secretary problem revisited: Optimal selection strategy for top candidates using one try in a generalized version of the problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61384399%3A31140%2F24%3A00061047" target="_blank" >RIV/61384399:31140/24:00061047 - isvavai.cz</a>
Result on the web
<a href="https://annals-csis.org/Volume_39/drp/pdf/3882.pdf" target="_blank" >https://annals-csis.org/Volume_39/drp/pdf/3882.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.15439/2024F3882" target="_blank" >10.15439/2024F3882</a>
Alternative languages
Result language
angličtina
Original language name
Secretary problem revisited: Optimal selection strategy for top candidates using one try in a generalized version of the problem
Original language description
Main topics of the document: secretary problem; optimal selection strategy; top candidates; one try; generalized version
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10103 - Statistics and probability
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 19th Conference on Computer Science and Intelligence Systems (FedCSIS)
ISBN
978-83-969601-6-0
ISSN
2300-5963
e-ISSN
2300-5963
Number of pages
6
Pages from-to
719-724
Publisher name
Warszawa: Polskie Towarzystwo Informatyczne
Place of publication
Polsko
Event location
Bělehrad, Srbsko
Event date
Sep 8, 2024
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
001413201600089