{"id":"https://openalex.org/W2472698472","doi":"https://doi.org/10.1007/s10878-016-0050-8","title":"The solution of a generalized secretary problem via analytic expressions","display_name":"The solution of a generalized secretary problem via analytic expressions","publication_year":2016,"publication_date":"2016-06-27","ids":{"openalex":"https://openalex.org/W2472698472","doi":"https://doi.org/10.1007/s10878-016-0050-8","mag":"2472698472"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-016-0050-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-016-0050-8","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10878-016-0050-8.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs10878-016-0050-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Adam Woryna","orcid":null},"institutions":[{"id":"https://openalex.org/I119004910","display_name":"Silesian University of Technology","ror":"https://ror.org/02dyjk442","country_code":"PL","type":"education","lineage":["https://openalex.org/I119004910"]},{"id":"https://openalex.org/I4210137370","display_name":"Institute of Mathematics","ror":"https://ror.org/04hrrh248","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210137370","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Adam Woryna","raw_affiliation_strings":["Institute of Mathematics, Silesian University of Technology, ul. Kaszubska 23, 44-100, Gliwice, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Silesian University of Technology, ul. Kaszubska 23, 44-100, Gliwice, Poland","institution_ids":["https://openalex.org/I119004910","https://openalex.org/I4210137370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I119004910","https://openalex.org/I4210137370"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.07038888,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"33","issue":"4","first_page":"1469","last_page":"1491"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.002400000113993883,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.001500000013038516,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/secretary-problem","display_name":"Secretary problem","score":0.940500020980835},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.8083000183105469},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5810999870300293},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5756999850273132},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.48100000619888306},{"id":"https://openalex.org/keywords/optimal-stopping","display_name":"Optimal stopping","score":0.421099990606308}],"concepts":[{"id":"https://openalex.org/C183211740","wikidata":"https://www.wikidata.org/wiki/Q1372364","display_name":"Secretary problem","level":3,"score":0.940500020980835},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.8083000183105469},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6890000104904175},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5810999870300293},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5756999850273132},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.48100000619888306},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.421099990606308},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40070000290870667},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.3880999982357025},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3709000051021576},{"id":"https://openalex.org/C2983961125","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping rule","level":2,"score":0.35670000314712524},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.34869998693466187},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2784999907016754},{"id":"https://openalex.org/C186515451","wikidata":"https://www.wikidata.org/wiki/Q228191","display_name":"Random sequence","level":3,"score":0.2784000039100647},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C99888217","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping time","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-016-0050-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-016-0050-8","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10878-016-0050-8.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1607.07658","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1607.07658","pdf_url":"https://arxiv.org/pdf/1607.07658","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:RePEc:spr:jcomop:v:33:y:2017:i:4:d:10.1007_s10878-016-0050-8","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-016-0050-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10878-016-0050-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-016-0050-8","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10878-016-0050-8.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2472698472.pdf","grobid_xml":"https://content.openalex.org/works/W2472698472.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1569977504","https://openalex.org/W1593308833","https://openalex.org/W1989174203","https://openalex.org/W1991874296","https://openalex.org/W2025056293","https://openalex.org/W2047803872","https://openalex.org/W2051290144","https://openalex.org/W2085355319","https://openalex.org/W2115230768","https://openalex.org/W2797720335","https://openalex.org/W2963228229","https://openalex.org/W4231302157","https://openalex.org/W4233464598","https://openalex.org/W4238775085","https://openalex.org/W4247158798"],"related_works":[],"abstract_inverted_index":{"Given":[0],"integers":[1,69],"$$1\\le":[2,75],"k<n$$":[3],",":[4,66,78,114],"the":[5,18,37,43,47,54,86,90,100,106,120,123,126,134,148,173],"Gusein-Zade":[6],"version":[7],"of":[8,17,21,46,68,89,102,122,125,137,151],"a":[9,25,61,83,95,110,130],"generalized":[10],"secretary":[11],"problem":[12,121],"is":[13,39,51],"to":[14,146,160],"choose":[15],"one":[16,155],"k":[19],"best":[20,55,91],"n":[22],"candidates":[23],"for":[24,73,99,172],"secretary,":[26],"which":[27,132,144],"are":[28],"interviewing":[29],"in":[30,36],"random":[31],"order.":[32],"The":[33],"stopping":[34],"rule":[35],"selection":[38],"based":[40],"only":[41,171],"on":[42],"relative":[44],"ranks":[45],"successive":[48],"arrivals.":[49],"It":[50],"known":[52],"that":[53],"policy":[56,108],"can":[57],"be":[58],"described":[59],"by":[60,156],"non-decreasing":[62],"sequence":[63,84,111,131,154],"$$(s_1,":[64,112],"\\ldots":[65,113],"s_k)$$":[67,115],"with":[70,109],"$$l\\le":[71],"s_l<n$$":[72],"every":[74],"l\\le":[76],"k$$":[77],"and":[79,170],"conversely,":[80],"any":[81],"such":[82,165],"determines":[85],"general":[87],"structure":[88],"policy.":[92],"We":[93,117,139],"found":[94],"finite":[96,141],"analytic":[97,142],"expression":[98],"probability":[101,136],"success":[103],"when":[104],"using":[105],"optimal":[107,127,153],".":[116,162,177],"also":[118],"study":[119],"construction":[124],"sequence,":[128],"i.e.":[129],"maximizes":[133],"corresponding":[135],"success.":[138],"discovered":[140],"expressions":[143,166],"enable":[145],"calculate":[147],"elements":[149],"$$s_l$$":[150],"an":[152],"one,":[157],"from":[158],"$$l=k$$":[159],"$$l=1$$":[161],"Until":[163],"now,":[164],"were":[167],"derived":[168],"separately,":[169],"values":[174],"$$k\\le":[175],"3$$":[176]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-07-22T00:00:00"}