{"id":"https://openalex.org/W7138042276","doi":"https://doi.org/10.48550/arxiv.2603.13487","title":"Approximation Algorithms for Action-Reward Query-Commit Matching","display_name":"Approximation Algorithms for Action-Reward Query-Commit Matching","publication_year":2026,"publication_date":"2026-03-13","ids":{"openalex":"https://openalex.org/W7138042276","doi":"https://doi.org/10.48550/arxiv.2603.13487"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.13487","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13487","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,"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.13487","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049873439","display_name":"Mahsa Derakhshan","orcid":"https://orcid.org/0000-0002-8147-0113"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Derakhshan, Mahsa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129650067","display_name":"Andisheh Ghasemi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ghasemi, Andisheh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027304911","display_name":"Calum MacRury","orcid":"https://orcid.org/0000-0003-0966-4332"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"MacRury, Calum","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.22179999947547913,"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.22179999947547913,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.14630000293254852,"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"}},{"id":"https://openalex.org/T11163","display_name":"Organ Donation and Transplantation","score":0.09130000323057175,"subfield":{"id":"https://openalex.org/subfields/2739","display_name":"Public Health, Environmental and Occupational Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.727400004863739},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6147000193595886},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5260000228881836},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5203999876976013},{"id":"https://openalex.org/keywords/patience","display_name":"Patience","score":0.5072000026702881},{"id":"https://openalex.org/keywords/action","display_name":"Action (physics)","score":0.4959999918937683},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4797999858856201},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4410000145435333},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4043999910354614}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.727400004863739},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6147000193595886},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5260000228881836},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5203999876976013},{"id":"https://openalex.org/C2779755727","wikidata":"https://www.wikidata.org/wiki/Q15304496","display_name":"Patience","level":2,"score":0.5072000026702881},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.4959999918937683},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4797999858856201},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4410000145435333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43709999322891235},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4043999910354614},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39100000262260437},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.3856000006198883},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.3840999901294708},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38269999623298645},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3813999891281128},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.358599990606308},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.32350000739097595},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.30329999327659607},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2994000017642975},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.2578999996185303}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.13487","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13487","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,"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.13487","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13487","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,"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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.611336350440979,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Matching":[0],"problems":[1],"under":[2,22],"uncertainty":[3],"arise":[4],"in":[5,86,193,220],"applications":[6],"such":[7],"as":[8,32],"kidney":[9],"exchange,":[10],"hiring,":[11],"and":[12,52,103,119,128,173,222,233,257],"online":[13],"marketplaces.":[14],"A":[15],"decision-maker":[16],"must":[17,53],"sequentially":[18],"explore":[19],"potential":[20],"matches":[21,31],"local":[23],"exploration":[24],"constraints,":[25],"while":[26],"committing":[27],"irrevocably":[28,123],"to":[29,59,125,200],"successful":[30],"they":[33],"are":[34],"revealed.":[35],"The":[36],"query-commit":[37,77,84,219],"matching":[38,78,85,161],"problem":[39,149,167],"captures":[40,155],"these":[41],"challenges":[42],"by":[43,169],"modeling":[44],"edges":[45],"that":[46],"succeed":[47],"independently":[48],"with":[49],"known":[50,95],"probabilities":[51],"be":[54],"accepted":[55],"upon":[56],"success,":[57],"subject":[58],"vertex":[60],"patience":[61,196,224],"(time-out)":[62],"constraints":[63],"limiting":[64],"the":[65,75,100,104,107,126,129,135,142,164,177,194,217,241,244,247,252],"number":[66],"of":[67,83,106,144,159,191,229,243,255],"incident":[68],"queries.":[69],"In":[70,208],"this":[71,148,209],"work,":[72,210],"we":[73,211],"introduce":[74],"action-reward":[76,218],"problem,":[79,250],"a":[80,94,116,156,184,189],"strict":[81],"generalization":[82],"which":[87,198],"each":[88],"query":[89],"selects":[90],"an":[91,111],"action":[92,96,118],"from":[93],"space,":[97],"determining":[98],"both":[99,203],"success":[101],"probability":[102],"reward":[105,131],"queried":[108,114],"edge.":[109],"If":[110],"edge":[112,136],"is":[113,122,132,137],"using":[115],"chosen":[117],"succeeds,":[120],"it":[121],"added":[124],"matching,":[127],"corresponding":[130],"obtained;":[133],"otherwise,":[134],"permanently":[138],"discarded.":[139],"We":[140],"study":[141],"design":[143,212],"approximation":[145,186,227],"algorithms":[146,215],"for":[147,216,246],"on":[150],"bipartite":[151],"graphs.":[152],"This":[153],"model":[154],"broad":[157],"class":[158],"stochastic":[160],"problems,":[162],"including":[163],"sequential":[165,248],"pricing":[166,249],"introduced":[168],"Pollner,":[170],"Roghani,":[171],"Saberi,":[172],"Wajc":[174],"(EC~2022).":[175],"On":[176],"positive":[178],"side,":[179],"Pollner":[180],"et":[181],"al.":[182],"designed":[183],"polynomial-time":[185],"algorithm":[187],"achieving":[188,226],"ratio":[190],"$0.426$":[192,256],"one-sided":[195,221],"setting,":[197],"degrades":[199],"$0.395$":[201],"when":[202],"sides":[204],"have":[205],"bounded":[206],"patience.":[207],"computationally":[213],"efficient":[214],"two-sided":[223],"settings,":[225],"ratios":[228],"$1-1/e":[230],"\\approx":[231,235],"0.63$":[232],"$\\frac{1}{27}\\!\\left(19-67/e^3\\right)":[234],"0.58$":[236],"respectively.":[237],"These":[238],"results":[239],"improve":[240],"state":[242],"art":[245],"surpassing":[251],"previous":[253],"guarantees":[254],"$0.395$.":[258]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-18T00:00:00"}