{"id":"https://openalex.org/W4415163330","doi":"https://doi.org/10.48550/arxiv.2507.04551","title":"Greedy Dynamic Matching","display_name":"Greedy Dynamic Matching","publication_year":2025,"publication_date":"2025-07-06","ids":{"openalex":"https://openalex.org/W4415163330","doi":"https://doi.org/10.48550/arxiv.2507.04551"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2507.04551","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.04551","pdf_url":"https://arxiv.org/pdf/2507.04551","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2507.04551","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015546875","display_name":"Nick Arnosti","orcid":"https://orcid.org/0000-0002-6685-1428"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Arnosti, Nick","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5050873414","display_name":"Felipe Sim\u00f3n","orcid":"https://orcid.org/0000-0002-2653-9798"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Simon, Felipe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015546875"],"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/T11269","display_name":"Algorithms and Data Compression","score":0.9842000007629395,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9842000007629395,"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.660099983215332},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6310999989509583},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5903000235557556},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5519999861717224},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.5026000142097473},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43050000071525574},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.3833000063896179}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.660099983215332},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6310999989509583},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5903000235557556},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5519999861717224},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5026000142097473},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4927999973297119},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43050000071525574},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.3833000063896179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3562000095844269},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.3422999978065491},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33649998903274536},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3327000141143799},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.3230000138282776},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26159998774528503},{"id":"https://openalex.org/C201236551","wikidata":"https://www.wikidata.org/wiki/Q7310809","display_name":"Relative value","level":2,"score":0.2590999901294708}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2507.04551","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.04551","pdf_url":"https://arxiv.org/pdf/2507.04551","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2507.04551","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.04551","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2507.04551","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.04551","pdf_url":"https://arxiv.org/pdf/2507.04551","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,34,74,90,178],"study":[1],"a":[2,44,76,98,147,162,246,257],"foundational":[3],"model":[4,12],"of":[5,38,46,62,79,95,104,114,133,143,164,175,184,190,214,224,235,267],"dynamic":[6],"matching":[7],"market":[8,135],"with":[9],"abandonment.":[10],"This":[11,219,273],"has":[13],"been":[14],"studied":[15],"by":[16,195,280],"Collina":[17,227,281],"et":[18,282,287],"al":[19,283,288],"(2020)":[20,284],"and":[21,23,26,51,71,285],"Aouad":[22],"Saritac":[24],"(2022),":[25],"many":[27],"other":[28],"papers":[29],"have":[30,119,136],"considered":[31],"special":[32],"cases.":[33],"compare":[35],"the":[36,68,93,102,105,120,130,134,137,154,169,172,182,191,196,215,222,238,264,268,276],"performance":[37],"greedy":[39,86,106,207],"policies":[40],"--":[41,59],"which":[42,66,85,152],"identify":[43,84],"set":[45,163],"\"acceptable\"":[47],"matches":[48,54],"up":[49],"front,":[50],"perform":[52],"these":[53,144,253],"as":[55,57],"soon":[56],"possible":[58],"to":[60,83,88,171],"that":[61,92,108,156,181,261],"an":[63],"omniscient":[64,197,216,269],"benchmark":[65],"knows":[67],"full":[69],"arrival":[70],"departure":[72,122,139],"sequence.":[73],"use":[75,146],"novel":[77],"family":[78],"linear":[80,259],"programs":[81],"($LP^{ALG}$)":[82],"policy":[87,107,198,208,243,270],"follow.":[89],"show":[91,180,252],"value":[94,103,183,266],"$LP^{ALG}$":[96,185],"is":[97,166,186,237],"*lower":[99],"bound*":[100],"on":[101,129],"it":[109],"identifies":[110],"in":[111,168],"two":[112],"settings":[113,204,231],"interest:":[115],"-When":[116],"all":[117],"types":[118,128,165],"same":[121,131,138],"rate.":[123,140,218],"-The":[124],"bipartite":[125],"case":[126],"where":[127],"side":[132],"The":[141],"proofs":[142],"results":[145,254],"new":[148,258],"result":[149],"(Lemma":[150],"1),":[151],"relates":[153],"*probability*":[155],"at":[157,187,211],"least":[158,188,212],"one":[159],"agent":[160],"from":[161,226],"present":[167],"system":[170],"expected":[173],"number":[174],"such":[176],"agents.":[177],"also":[179],"1/2":[189,236],"reward":[192,217],"rate":[193],"earned":[194],"(Proposition":[199,271],"4).":[200],"Therefore,":[201],"for":[202],"both":[203,230],"above,":[205],"our":[206,232],"provably":[209],"earns":[210],"half":[213],"improves":[220,274],"upon":[221,275],"bound":[223],"1/8":[225],"(2020).":[228],"In":[229],"competitive":[233],"ratio":[234],"best":[239],"possible:":[240],"no":[241],"online":[242],"can":[244],"provide":[245],"better":[247],"guarantee":[248],"(Theorem":[249],"2).":[250],"To":[251],"we":[255],"introduce":[256],"program":[260],"upper":[262,277],"bounds":[263,278],"objective":[265],"3).":[272],"presented":[279],"Kessel":[286],"(2022).":[289]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-14T00:00:00"}