{"id":"https://openalex.org/W4707454","doi":null,"title":"Algorithms for Submodular Matroid Secretary Problems Under Transversal Matroids and Partition Matroids","display_name":"Algorithms for Submodular Matroid Secretary Problems Under Transversal Matroids and Partition Matroids","publication_year":2011,"publication_date":"2011-07-12","ids":{"openalex":"https://openalex.org/W4707454","mag":"4707454"},"language":"en","primary_location":{"id":"mag:4707454","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1107.2188v3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"arXiv (Cornell University)","raw_type":null},"volume":null,"type":"preprint","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1107.2188v3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101455930","display_name":"Bo Tang","orcid":"https://orcid.org/0000-0001-8424-0092","observed_orcids":["https://orcid.org/0000-0001-8424-0092"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bo Tang","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8424-0092","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100454894","display_name":"Yajun Wang","orcid":"https://orcid.org/0000-0002-9990-0812","observed_orcids":["https://orcid.org/0000-0002-9990-0812"]},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yajun Wang","raw_affiliation_strings":["Microsoft"],"raw_orcid":"https://orcid.org/0000-0002-9990-0812","affiliations":[{"raw_affiliation_string":"Microsoft","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9872999787330627,"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.9872999787330627,"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.009499999694526196,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid-secretary-problem","display_name":"matroid secretary problem","score":0.9950000047683716},{"id":"https://openalex.org/keywords/submodularity","display_name":"submodular functions","score":0.9729999899864197},{"id":"https://openalex.org/keywords/transversal-matroids","display_name":"transversal matroids","score":0.9829999804496765},{"id":"https://openalex.org/keywords/partition-matroids","display_name":"partition matroids","score":0.9990000128746033},{"id":"https://openalex.org/keywords/online-bipartite-matching","display_name":"online bipartite matching","score":0.9079999923706055},{"id":"https://openalex.org/keywords/non-monotone-submodular-functions","display_name":"non-monotone submodular functions","score":0.9010000228881836},{"id":"https://openalex.org/keywords/online-algorithms","display_name":"online algorithms","score":0.6159999966621399}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9724372625350952},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9593331813812256},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.8251421451568604},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.7555717825889587},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.7041587233543396},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6535066366195679},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6037997603416443},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.5660871863365173},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.4934188425540924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48343929648399353},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.47188153862953186},{"id":"https://openalex.org/C183211740","wikidata":"https://www.wikidata.org/wiki/Q1372364","display_name":"Secretary problem","level":3,"score":0.471591591835022},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4678880274295807},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.45835036039352417},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4575873613357544},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3110891580581665},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29166746139526367},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2873559594154358},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21117618680000305},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.11205613613128662},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.09750190377235413},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.0},{"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/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":"mag:4707454","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1107.2188v3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"mag:4707454","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1107.2188v3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1601470474","https://openalex.org/W1931679055","https://openalex.org/W1989174203","https://openalex.org/W1989796562","https://openalex.org/W2011730242","https://openalex.org/W2021016639","https://openalex.org/W2022013502","https://openalex.org/W2061418963","https://openalex.org/W2085480884","https://openalex.org/W2113654320","https://openalex.org/W2158268067","https://openalex.org/W2164792208"],"related_works":["https://openalex.org/W2949714980","https://openalex.org/W2808107677","https://openalex.org/W1603367659","https://openalex.org/W195739637","https://openalex.org/W1974783786","https://openalex.org/W1568566671","https://openalex.org/W2071109974","https://openalex.org/W1819914325","https://openalex.org/W2052130355","https://openalex.org/W2796215898","https://openalex.org/W2893228190","https://openalex.org/W1486503122","https://openalex.org/W2107547393","https://openalex.org/W2952593185","https://openalex.org/W2056444878","https://openalex.org/W3099430045","https://openalex.org/W2159059797","https://openalex.org/W2027229272","https://openalex.org/W3129885107","https://openalex.org/W2058489697"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,7,18,21,61,66,69,85,126,148,152,164],"matroid":[3,26,87],"secretary":[4,88,127],"problem":[5,89,128],"when":[6,163],"valuation":[8,67,97],"is":[9,54,71,80],"defined":[10],"by":[11],"a":[12,25,74,81,105,110,119],"submodular":[13,75,86,96,142],"function.":[14,76],"In":[15,99],"this":[16],"problem,":[17],"elements":[19],"of":[20,24,68],"ground":[22],"set":[23,59,70],"are":[27],"arriving":[28],"in":[29],"random":[30],"order.":[31],"When":[32],"one":[33],"element":[34],"arrives,":[35],"we":[36,102,123],"have":[37],"to":[38,49,55],"make":[39],"an":[40,57,134],"immediate":[41],"and":[42,132],"irrevocable":[43],"decision":[44],"regarding":[45],"whether":[46],"or":[47],"not":[48],"accept":[50],"it.":[51],"Our":[52,77],"objective":[53],"select":[56],"independent":[58],"under":[60,90,129],"given":[62],"matroid,":[63],"so":[64],"that":[65],"maximized":[72],"with":[73,93],"major":[78],"result":[79],"constant-competitive":[82],"algorithm":[83,108,137,145],"for":[84,109],"transversal":[91],"matroids":[92,131],"monotonically":[94],"increasing":[95],"functions.":[98,143],"addressing":[100],"it,":[101],"instead":[103],"develop":[104],"constant":[106],"competitive":[107,149],"more":[111],"general":[112],"online":[113],"bipartite":[114],"graph":[115],"matching":[116],"problem.":[117],"As":[118],"natural":[120],"special":[121],"case,":[122],"also":[124],"consider":[125],"partition":[130],"provide":[133],"extremely":[135],"simple":[136],"which":[138],"can":[139],"handle":[140],"non-monotone":[141],"This":[144,159],"significantly":[146],"improves":[147],"ratio":[150],"over":[151],"previous":[153],"work.":[154],"Shanghai":[155],"Jiao":[156],"Tong":[157],"University.":[158],"work":[160],"was":[161,166],"done":[162],"author":[165],"visiting":[167],"Microsoft":[168,171],"Research":[169,172],"Asia.":[170],"Asia,":[173],"yajunw@microsoft.com":[174]},"counts_by_year":[],"updated_date":"2026-10-02T10:15:12.560889","created_date":"2025-10-27T00:00:00"}