{"id":"https://openalex.org/W2014543842","doi":"https://doi.org/10.1137/s0895480104440596","title":"Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case","display_name":"Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2014543842","doi":"https://doi.org/10.1137/s0895480104440596","mag":"2014543842"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480104440596","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480104440596","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103031015","display_name":"Grzegorz Kubicki","orcid":"https://orcid.org/0000-0002-5531-167X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Grzegorz Kubicki","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033991835","display_name":"Micha\u0142 Morayne","orcid":"https://orcid.org/0000-0002-9856-479X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michal Morayne","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103031015"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.14897895,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"19","issue":"3","first_page":"622","last_page":"632"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T11182","display_name":"Auction Theory and Applications","score":0.9915000200271606,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.932200014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8408525586128235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7431496381759644},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6378685235977173},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6210784316062927},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.561922013759613},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47170567512512207},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46353864669799805},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.45908063650131226},{"id":"https://openalex.org/keywords/secretary-problem","display_name":"Secretary problem","score":0.43624112010002136},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.41133901476860046},{"id":"https://openalex.org/keywords/optimal-stopping","display_name":"Optimal stopping","score":0.2156619131565094},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13287004828453064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11040294170379639}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8408525586128235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7431496381759644},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6378685235977173},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6210784316062927},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.561922013759613},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47170567512512207},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46353864669799805},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.45908063650131226},{"id":"https://openalex.org/C183211740","wikidata":"https://www.wikidata.org/wiki/Q1372364","display_name":"Secretary problem","level":3,"score":0.43624112010002136},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.41133901476860046},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.2156619131565094},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13287004828453064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11040294170379639},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0895480104440596","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480104440596","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.8199999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2019516620","https://openalex.org/W2036650989","https://openalex.org/W2051231039","https://openalex.org/W2085480884","https://openalex.org/W2116459287","https://openalex.org/W4231302157"],"related_works":["https://openalex.org/W1931679055","https://openalex.org/W3116213140","https://openalex.org/W2335267977","https://openalex.org/W4213075821","https://openalex.org/W2002177687","https://openalex.org/W2287463498","https://openalex.org/W1754694893","https://openalex.org/W2588356017","https://openalex.org/W2944744777","https://openalex.org/W3190612612"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,33,36,41,46,60,65,71,75,105,109,113,118],"following":[3],"on-line":[4],"decision":[5],"problem.":[6],"The":[7,54],"vertices":[8,48],"of":[9,13,104,112],"a":[10,14,28,90,101],"directed":[11,42,106],"path":[12,107],"known":[15],"length":[16],"are":[17],"being":[18],"observed":[19],"one":[20,22,77],"by":[21,27,45],"in":[23],"some":[24],"random":[25],"order":[26],"selector.":[29],"At":[30],"time":[31],"t":[32,47],"selector":[34],"examines":[35],"tth":[37],"vertex":[38,63,69],"and":[39,123],"knows":[40],"graph":[43],"induced":[44],"that":[49,67,78,127],"have":[50,81],"been":[51],"already":[52],"examined.":[53],"selector's":[55],"aim":[56],"is":[57,70,98,121,125],"to":[58,117],"choose":[59],"currently":[61],"examined":[62],"maximizing":[64],"probability":[66,110],"this":[68],"\"uppermost\"":[72],"one,":[73],"i.e.,":[74],"only":[76],"does":[79],"not":[80],"an":[82],"outgoing":[83],"edge.":[84],"An":[85],"optimal":[86,95,119],"algorithm":[87,120],"for":[88],"such":[89],"choice":[91,115],"(in":[92],"other":[93],"words,":[94],"stopping":[96],"time)":[97],"given.":[99],"For":[100],"cardinality":[102],"n":[103],"considered,":[108],"$p_n$":[111],"right":[114],"according":[116],"given,":[122],"it":[124],"shown":[126],"$p_n\\sqrt{n}":[128],"\\rightarrow":[129,133],"\\sqrt{\\pi}/2$":[130],"as":[131],"$n":[132],"\\infty$.":[134]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}