{"id":"https://openalex.org/W2796215898","doi":"https://doi.org/10.1137/16m1105220","title":"The Submodular Secretary Problem Goes Linear","display_name":"The Submodular Secretary Problem Goes Linear","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2796215898","doi":"https://doi.org/10.1137/16m1105220","mag":"2796215898"},"language":"en","primary_location":{"id":"doi:10.1137/16m1105220","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1105220","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5077772086","display_name":"Moran Feldman","orcid":"https://orcid.org/0000-0002-1535-2979"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Moran Feldman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033406324","display_name":"Rico Zenklusen","orcid":"https://orcid.org/0000-0002-7148-9304"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rico Zenklusen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077772086"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3989,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.89627834,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"47","issue":"2","first_page":"330","last_page":"366"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9449355602264404},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9128532409667969},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.8524515628814697},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.7992579936981201},{"id":"https://openalex.org/keywords/secretary-problem","display_name":"Secretary problem","score":0.703702986240387},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6075558066368103},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5725841522216797},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5538609027862549},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5501160025596619},{"id":"https://openalex.org/keywords/oriented-matroid","display_name":"Oriented matroid","score":0.5059513449668884},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.5005176067352295},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4639351963996887},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24754467606544495},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.09980788826942444}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9449355602264404},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9128532409667969},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.8524515628814697},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.7992579936981201},{"id":"https://openalex.org/C183211740","wikidata":"https://www.wikidata.org/wiki/Q1372364","display_name":"Secretary problem","level":3,"score":0.703702986240387},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6075558066368103},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5725841522216797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5538609027862549},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5501160025596619},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.5059513449668884},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.5005176067352295},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4639351963996887},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24754467606544495},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.09980788826942444},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1105220","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1105220","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5926618553","display_name":null,"funder_award_id":"200021_165866","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G7532835206","display_name":null,"funder_award_id":"335288","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G7746946551","display_name":null,"funder_award_id":"1357/16","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1529760171","https://openalex.org/W1989006984","https://openalex.org/W1989174203","https://openalex.org/W2036190740","https://openalex.org/W2052130355","https://openalex.org/W2053381548","https://openalex.org/W2064933851","https://openalex.org/W2085480884","https://openalex.org/W2094067695","https://openalex.org/W2109969113","https://openalex.org/W2165436315","https://openalex.org/W2293593229","https://openalex.org/W2797720335","https://openalex.org/W4231302157","https://openalex.org/W4234259186"],"related_works":["https://openalex.org/W2400862597","https://openalex.org/W1984819493","https://openalex.org/W4246417054","https://openalex.org/W1963746795","https://openalex.org/W4300196460","https://openalex.org/W278334329","https://openalex.org/W2951318005","https://openalex.org/W2964600740","https://openalex.org/W4289285488","https://openalex.org/W4707454"],"abstract_inverted_index":{"During":[0],"the":[1,4,12,27,39,53,56,75,86,95,112,137,231,238,245,278,316,327],"last":[2],"decade,":[3],"matroid":[5,58,128,138,215,233,239,270,280,297],"secretary":[6,59,139,240],"problem":[7],"(MSP)":[8],"became":[9],"one":[10,28,141],"of":[11,16,35,55,77,80,97],"most":[13,156],"prominent":[14],"classes":[15,298],"online":[17,68],"selection":[18],"problems.":[19],"The":[20,90],"interest":[21,71,113],"in":[22,67,74,114,220,251],"MSP":[23,47,88,172,179,276],"is":[24,43,52,107,186,242,255],"twofold:":[25],"on":[26,38,85,326],"hand,":[29,41],"there":[30,42],"are":[31,182],"many":[32,287],"interesting":[33],"applications":[34,66],"MSP,":[36,81,209,322],"and":[37,289,323],"other":[40],"strong":[44],"hope":[45,133],"that":[46,92,204,237],"admits":[48],"$O(1)$-competitive":[49,118,145,206,226,263,291],"algorithms,":[50],"which":[51],"claim":[54],"well-known":[57],"conjecture.":[60],"Partially":[61],"linked":[62],"to":[63,136,154,159,176,187,198,212,224,244,261,274],"its":[64],"numerous":[65],"auctions,":[69],"substantial":[70],"arose":[72],"also":[73],"study":[76],"nonlinear":[78],"versions":[79],"with":[82],"a":[83,100,108,213,221,268],"focus":[84],"submodular":[87],"(SMSP).":[89],"fact":[91],"submodularity":[93],"captures":[94],"property":[96,103],"diminishing":[98],"returns,":[99],"very":[101],"natural":[102],"for":[104,111,123,147,208,228,248,265,293,303,312,321,332],"valuation":[105],"functions,":[106],"key":[109],"reason":[110],"SMSP.":[115,249,333],"So":[116],"far,":[117],"algorithms":[119,146,264,292,302],"have":[120],"been":[121],"obtained":[122],"SMSP":[124,148,160,165,181,197,229,254,266,294],"over":[125,149,230,267,277,295],"some":[126,132],"basic":[127],"classes.":[129],"This":[130,235],"created":[131],"that,":[134],"analogously":[135],"conjecture,":[140],"may":[142,166],"even":[143,210],"obtain":[144,286],"any":[150,205],"matroid.":[151],"However,":[152],"up":[153],"now,":[155],"questions":[157],"related":[158],"remained":[161],"open,":[162],"including":[163],"whether":[164],"be":[167,218],"substantially":[168,324],"more":[169,174],"difficult":[170],"than":[171,258],"and,":[173,180],"generally,":[175],"what":[177],"extent":[178],"related.":[183],"Our":[184],"goal":[185],"address":[188],"these":[189],"points":[190],"by":[191,299],"presenting":[192],"general":[193],"black-box":[194,222],"reductions":[195,284,307],"from":[196],"MSP.":[199,259,304],"In":[200],"particular,":[201],"we":[202,285],"show":[203],"algorithm":[207,227,311,320,331],"restricted":[211],"particular":[214,269],"class,":[216,271],"can":[217],"transformed":[219],"way":[223],"an":[225,309],"same":[232,246,279],"class.":[234,281],"implies":[236],"conjecture":[241,247],"equivalent":[243],"Hence,":[250],"this":[252],"sense":[253],"not":[256],"harder":[257],"Also,":[260],"find":[262],"it":[272],"suffices":[273],"consider":[275],"Using":[282],"our":[283,306],"first":[288],"improved":[290],"various":[296],"leveraging":[300],"known":[301],"Moreover,":[305],"imply":[308],"$O(\\log\\log({rank}))$-competitive":[310],"SMSP,":[313],"thus,":[314],"matching":[315],"currently":[317],"best":[318,329],"asymptotic":[319],"improving":[325],"previously":[328],"$O(\\log({rank}))$-competitive":[330]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}