{"id":"https://openalex.org/W2104224720","doi":"https://doi.org/10.1145/1993636.1993715","title":"Online bipartite matching with unknown distributions","display_name":"Online bipartite matching with unknown distributions","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2104224720","doi":"https://doi.org/10.1145/1993636.1993715","mag":"2104224720"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993715","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993715","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993715","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035204666","display_name":"Chinmay Karande","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chinmay Karande","raw_affiliation_strings":["Google Research, Mountain View, CA, USA","Google Research, Mountain View, CA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Research, Mountain View, CA, USA#TAB#","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075894805","display_name":"Aranyak Mehta","orcid":"https://orcid.org/0000-0002-6132-4901"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aranyak Mehta","raw_affiliation_strings":["Google Research, Mountain View, CA, USA","Google Research, Mountain View, CA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Research, Mountain View, CA, USA#TAB#","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040307243","display_name":"Pushkar Tripathi","orcid":"https://orcid.org/0000-0001-5135-6136"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pushkar Tripathi","raw_affiliation_strings":["Georgia Inst. of Technology, Atlanta, GA, USA","Georgia Institute of Technology Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Inst. of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Georgia Institute of Technology Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":203,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"587","last_page":"596"},"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.9948999881744385,"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.9850000143051147,"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/bipartite-graph","display_name":"Bipartite graph","score":0.8340729475021362},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7488912343978882},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7362089157104492},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.7270187735557556},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6796232461929321},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5973567366600037},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.504135251045227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4669438600540161},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.451281875371933},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.42213353514671326},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38412559032440186},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33268505334854126},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23586851358413696},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1744345724582672},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1383311152458191},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07381433248519897}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8340729475021362},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7488912343978882},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7362089157104492},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.7270187735557556},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6796232461929321},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5973567366600037},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.504135251045227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4669438600540161},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.451281875371933},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.42213353514671326},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38412559032440186},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33268505334854126},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23586851358413696},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1744345724582672},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1383311152458191},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07381433248519897},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1993636.1993715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993715","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993715","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.8467","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.8467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cc.gatech.edu/grads/t/tpushkar/papers/bipartite.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.308.4104","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.4104","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://static.googleusercontent.com/external_content/untrusted_dlcp/research.google.com/en/us/pubs/archive/37205.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/1993636.1993715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993715","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993715","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2104224720.pdf","grobid_xml":"https://content.openalex.org/works/W2104224720.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1496647032","https://openalex.org/W1522394790","https://openalex.org/W1542279226","https://openalex.org/W1769120835","https://openalex.org/W2010060477","https://openalex.org/W2011730242","https://openalex.org/W2015324401","https://openalex.org/W2048837158","https://openalex.org/W2062259223","https://openalex.org/W2079669094","https://openalex.org/W2113654320","https://openalex.org/W2131951207","https://openalex.org/W2158268067","https://openalex.org/W2162656786","https://openalex.org/W2170675255","https://openalex.org/W2571343094","https://openalex.org/W6662450958"],"related_works":["https://openalex.org/W2953461625","https://openalex.org/W2567825307","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2785998768","https://openalex.org/W2945016732","https://openalex.org/W2371352078","https://openalex.org/W2362975861","https://openalex.org/W1968154277","https://openalex.org/W2804963084"],"abstract_inverted_index":{"We":[0,13,69],"consider":[1],"the":[2,8,16,31,40,47,57,85],"online":[3],"bipartite":[4],"matching":[5],"problem":[6],"in":[7,46,53,56,67,84,119],"unknown":[9,48],"distribution":[10,49],"input":[11],"model.":[12,88],"show":[14,35,91],"that":[15,92],"Ranking":[17,78,103,121],"algorithm":[18,37],"of":[19,25,74,108,125],"[KVV90]":[20],"achieves":[21,104,122],"a":[22,72,105,123],"competitive":[23,106],"ratio":[24,107],"at":[26,109],"least":[27,110],"0.653.":[28],"This":[29],"is":[30],"first":[32],"analysis":[33,52],"to":[34],"an":[36,64],"which":[38,77,95],"breaks":[39],"natural":[41],"1":[42,99,111,126],"-":[43,112,114,127],"1/e":[44],"-barrier'":[45],"model":[50],"(our":[51],"fact":[54],"works":[55],"stricter,":[58],"random":[59,86],"order":[60,87],"model)":[61],"and":[62],"answers":[63],"open":[65],"question":[66],"[GM08].":[68],"also":[70],"describe":[71],"family":[73],"graphs":[75,94,130],"on":[76],"does":[79],"no":[80],"better":[81],"than":[82],"0.727":[83],"Finally,":[89],"we":[90],"for":[93,129],"have":[96],"k":[97],">":[98],"disjoint":[100,133],"perfect":[101,134],"matchings,":[102],"\u221a(1/k":[113],"1/k2":[115],"+":[116],"1/n)":[117],"--":[118],"particular":[120],"factor":[124],"o(1)":[128],"with":[131],"\u03c9(1)":[132],"matchings.":[135]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":20},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":22},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":12}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}