{"id":"https://openalex.org/W1989006984","doi":"https://doi.org/10.1145/2491533.2491557","title":"Recent advances on the matroid secretary problem","display_name":"Recent advances on the matroid secretary problem","publication_year":2013,"publication_date":"2013-06-03","ids":{"openalex":"https://openalex.org/W1989006984","doi":"https://doi.org/10.1145/2491533.2491557","mag":"1989006984"},"language":"en","primary_location":{"id":"doi:10.1145/2491533.2491557","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2491533.2491557","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","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/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":["Weizmann Institute of Science"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049161363"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":6.4227,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.96724305,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"44","issue":"2","first_page":"126","last_page":"142"},"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.991100013256073,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9462000131607056,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9540348052978516},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.6652119755744934},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6641237139701843},{"id":"https://openalex.org/keywords/secretary-problem","display_name":"Secretary problem","score":0.5778017640113831},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5751163959503174},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.4987494945526123},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.4802863299846649},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.44262874126434326},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43350666761398315},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3998723030090332},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33255380392074585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31705549359321594},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2055564820766449},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.14480060338974},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06839865446090698}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9540348052978516},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.6652119755744934},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6641237139701843},{"id":"https://openalex.org/C183211740","wikidata":"https://www.wikidata.org/wiki/Q1372364","display_name":"Secretary problem","level":3,"score":0.5778017640113831},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5751163959503174},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.4987494945526123},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.4802863299846649},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.44262874126434326},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43350666761398315},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3998723030090332},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33255380392074585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31705549359321594},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2055564820766449},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.14480060338974},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06839865446090698},{"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/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2491533.2491557","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2491533.2491557","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W134723529","https://openalex.org/W1485683624","https://openalex.org/W1503396090","https://openalex.org/W1568448158","https://openalex.org/W1579140566","https://openalex.org/W1601470474","https://openalex.org/W1819914325","https://openalex.org/W1858787623","https://openalex.org/W1931679055","https://openalex.org/W1989174203","https://openalex.org/W1989796562","https://openalex.org/W2022013502","https://openalex.org/W2040101882","https://openalex.org/W2040622094","https://openalex.org/W2061418963","https://openalex.org/W2085480884","https://openalex.org/W2100658172","https://openalex.org/W2107547393","https://openalex.org/W2113654320","https://openalex.org/W2165436315","https://openalex.org/W2506304636","https://openalex.org/W2912381149","https://openalex.org/W2963176468","https://openalex.org/W4214843198","https://openalex.org/W4255288880"],"related_works":["https://openalex.org/W2951941558","https://openalex.org/W1568448158","https://openalex.org/W4214843198","https://openalex.org/W1819914325","https://openalex.org/W4300671415","https://openalex.org/W2808107677","https://openalex.org/W1981530653","https://openalex.org/W2052130355","https://openalex.org/W2022013502","https://openalex.org/W2964043695"],"abstract_inverted_index":{"The":[0],"matroid":[1,68],"secretary":[2,69],"problem":[3,17],"was":[4,19],"introduced":[5],"by":[6],"Babaioff,":[7],"Immorlica,":[8],"and":[9,23,35,39],"Kleinberg":[10],"in":[11,74],"SODA":[12],"2007":[13],"as":[14],"an":[15,85],"online":[16,27],"that":[18,49],"both":[20],"mathematically":[21],"interesting":[22],"had":[24],"applications":[25],"to":[26],"auctions.":[28],"In":[29],"this":[30,37],"column":[31],"I":[32],"will":[33],"introduce":[34],"motivate":[36],"problem,":[38],"give":[40],"a":[41,63],"survey":[42],"of":[43,45,67],"some":[44],"the":[46,56,76],"exciting":[47],"work":[48],"has":[50],"been":[51],"done":[52],"on":[53],"it":[54],"over":[55],"past":[57],"6":[58],"years.":[59],"While":[60],"we":[61,72],"have":[62],"much":[64],"better":[65],"understanding":[66],"now":[70],"than":[71],"did":[73],"2007,":[75],"main":[77],"conjecture":[78],"is":[79],"still":[80],"open:":[81],"does":[82],"there":[83],"exist":[84],"O(1)-competitive":[86],"algorithm.":[87]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}