{"id":"https://openalex.org/W4383533385","doi":"https://doi.org/10.1145/3580507.3597794","title":"The Power of Greedy for Online Minimum Cost Matching on the Line","display_name":"The Power of Greedy for Online Minimum Cost Matching on the Line","publication_year":2023,"publication_date":"2023-07-07","ids":{"openalex":"https://openalex.org/W4383533385","doi":"https://doi.org/10.1145/3580507.3597794"},"language":"en","primary_location":{"id":"doi:10.1145/3580507.3597794","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3580507.3597794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th ACM Conference on Economics and Computation","raw_type":"proceedings-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/A5067293707","display_name":"Eric Balkanski","orcid":"https://orcid.org/0000-0001-6876-7919"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eric Balkanski","raw_affiliation_strings":["Columbia University, New York, United States of America"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, United States of America","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073986859","display_name":"Yuri Faenza","orcid":"https://orcid.org/0000-0002-3148-2159"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuri Faenza","raw_affiliation_strings":["Columbia University, New York, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084524014","display_name":"No\u00e9mie P\u00e9rivier","orcid":"https://orcid.org/0000-0001-7854-4057"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"No\u00e9mie P\u00e9rivier","raw_affiliation_strings":["Columbia University, New York, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, USA","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067293707"],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":1.2142,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.80057582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"185","last_page":"205"},"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9812999963760376,"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/server","display_name":"Server","score":0.6895061135292053},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6875922679901123},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6765188574790955},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.670748770236969},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5760860443115234},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5258054137229919},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5015311241149902},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.49137774109840393},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4355343282222748},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.28648748993873596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2152901589870453},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20727771520614624},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15765640139579773},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13656553626060486}],"concepts":[{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.6895061135292053},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6875922679901123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6765188574790955},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.670748770236969},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5760860443115234},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5258054137229919},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5015311241149902},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.49137774109840393},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4355343282222748},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.28648748993873596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2152901589870453},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20727771520614624},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15765640139579773},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13656553626060486},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3580507.3597794","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3580507.3597794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th ACM Conference on Economics and Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Zero hunger","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/2"}],"awards":[{"id":"https://openalex.org/G2017050059","display_name":null,"funder_award_id":"CCF-2210501","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3035329574","display_name":null,"funder_award_id":"IIS-2147361","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3267282267","display_name":null,"funder_award_id":"2046146","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W181346458","https://openalex.org/W1552810675","https://openalex.org/W1587434700","https://openalex.org/W1659045240","https://openalex.org/W1968225281","https://openalex.org/W1978382073","https://openalex.org/W1995337396","https://openalex.org/W1999361850","https://openalex.org/W2011730242","https://openalex.org/W2070546659","https://openalex.org/W2077182069","https://openalex.org/W2098375959","https://openalex.org/W2125120324","https://openalex.org/W2145995017","https://openalex.org/W2162656786","https://openalex.org/W2166752738","https://openalex.org/W2519455498","https://openalex.org/W2525830997","https://openalex.org/W2572141964","https://openalex.org/W2768304016","https://openalex.org/W2910480949","https://openalex.org/W2944349774","https://openalex.org/W2965135159","https://openalex.org/W3082847752","https://openalex.org/W3122912776","https://openalex.org/W3139810301","https://openalex.org/W3208317688","https://openalex.org/W4247154108","https://openalex.org/W4247564011","https://openalex.org/W4285089627","https://openalex.org/W4285451384","https://openalex.org/W4303489094"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2970577745","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895"],"abstract_inverted_index":{"In":[0,120],"the":[1,36,40,43,46,80,82,127,132],"online":[2],"minimum":[3,50],"cost":[4,51],"matching":[5,52],"problem,":[6],"there":[7],"are":[8,137],"n":[9,15,77],"servers":[10],"and,":[11],"at":[12,138],"each":[13,88],"of":[14,38,42,103,129],"time":[16],"steps,":[17],"a":[18,27,54,69,101],"request":[19,89],"arrives":[20],"and":[21,63,99],"must":[22],"be":[23],"irrevocably":[24],"matched":[25,47],"to":[26,90,114,125],"server":[28],"that":[29,73,136],"has":[30,100],"not":[31],"yet":[32],"been":[33],"matched,":[34],"with":[35],"goal":[37],"minimizing":[39],"sum":[41],"distances":[44],"between":[45],"pairs.":[48],"Online":[49],"is":[53,74,112],"central":[55],"problem":[56],"in":[57,76,97],"applications":[58],"such":[59,106],"as":[60,107],"ride-hailing":[61],"platforms":[62],"food":[64],"delivery":[65],"services.":[66],"Despite":[67],"achieving":[68],"worst-case":[70],"competitive":[71],"ratio":[72],"exponential":[75],"even":[78],"on":[79,131],"line,":[81],"simple":[83],"greedy":[84,130],"algorithm,":[85],"which":[86],"matches":[87],"its":[91],"nearest":[92],"available":[93],"server,":[94],"performs":[95],"well":[96],"practice":[98],"number":[102],"attractive":[104],"features":[105],"strategyproofness.":[108],"A":[109],"major":[110],"question":[111],"thus":[113],"explain":[115],"greedy's":[116],"strong":[117],"empirical":[118],"performance.":[119],"this":[121],"paper,":[122],"we":[123],"aim":[124],"understand":[126],"performance":[128],"line":[133],"over":[134],"instances":[135],"least":[139],"partially":[140],"random.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}