{"id":"https://openalex.org/W4383558092","doi":"https://doi.org/10.1145/3580507.3597803","title":"Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual","display_name":"Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual","publication_year":2023,"publication_date":"2023-07-07","ids":{"openalex":"https://openalex.org/W4383558092","doi":"https://doi.org/10.1145/3580507.3597803"},"language":"en","primary_location":{"id":"doi:10.1145/3580507.3597803","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3580507.3597803","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/A5036048708","display_name":"Farbod Ekbatani","orcid":"https://orcid.org/0009-0009-4456-0492"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Farbod Ekbatani","raw_affiliation_strings":["Booth School of Business, University of Chicago, Chicago, IL, USA"],"raw_orcid":"https://orcid.org/0009-0009-4456-0492","affiliations":[{"raw_affiliation_string":"Booth School of Business, University of Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041757714","display_name":"Yiding Feng","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yiding Feng","raw_affiliation_strings":["Microsoft Research, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-8258-6994","affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014759933","display_name":"Rad Niazadeh","orcid":"https://orcid.org/0000-0002-5880-6221"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rad Niazadeh","raw_affiliation_strings":["Booth School of Business, University of Chicago, Chicago, IL, United States of America"],"raw_orcid":"https://orcid.org/0000-0002-5880-6221","affiliations":[{"raw_affiliation_string":"Booth School of Business, University of Chicago, Chicago, IL, United States of America","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036048708"],"corresponding_institution_ids":["https://openalex.org/I40347166"],"apc_list":null,"apc_paid":null,"fwci":0.3935,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60573004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"583","last_page":"583"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9772999882698059,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9585000276565552,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.8154033422470093},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7648639678955078},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5270317196846008},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5226768851280212},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.509584903717041},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4793292284011841},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4440573453903198},{"id":"https://openalex.org/keywords/decision-maker","display_name":"Decision maker","score":0.4430628716945648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40094953775405884},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39549094438552856},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16962659358978271},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.10753253102302551}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8154033422470093},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7648639678955078},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5270317196846008},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5226768851280212},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.509584903717041},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4793292284011841},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4440573453903198},{"id":"https://openalex.org/C2986080485","wikidata":"https://www.wikidata.org/wiki/Q1331926","display_name":"Decision maker","level":2,"score":0.4430628716945648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40094953775405884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39549094438552856},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16962659358978271},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.10753253102302551},{"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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3580507.3597803","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3580507.3597803","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"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-141744","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-141744","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"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":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"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/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W4390751688"],"abstract_inverted_index":{"Motivated":[0],"by":[1,64,101,134,157],"applications":[2],"in":[3],"cloud":[4],"computing":[5],"spot":[6],"markets":[7],"and":[8,142,147,172],"selling":[9],"banner":[10],"ads":[11],"on":[12],"popular":[13],"websites,":[14],"we":[15,29],"study":[16],"the":[17,31,42,69,73,79,99,102,129,173],"online":[18,35,61],"resource":[19,54],"allocation":[20],"problem":[21,37,100],"with":[22,38],"costly":[23],"buyback.":[24],"To":[25],"model":[26],"this":[27,92,155],"problem,":[28],"consider":[30],"classic":[32],"edge-weighted":[33],"fractional":[34],"matching":[36],"a":[39,86,121,160,163],"tweak,":[40],"where":[41],"decision":[43,70],"maker":[44,71],"can":[45],"recall":[46],"(i.e.,":[47],"buyback)":[48],"any":[49],"fraction":[50],"of":[51,91,118,125,131,140,165,178],"an":[52,59,95],"offline":[53],"that":[55],"is":[56,109],"pre-allocated":[57],"to":[58,84],"earlier":[60],"vertex;":[62],"however,":[63],"doing":[65],"so":[66],"not":[67],"only":[68],"loses":[72],"previously":[74],"allocated":[75],"reward":[76],"(which":[77],"equates":[78],"edge-weight),":[80],"it":[81],"also":[82],"has":[83],"pay":[85],"non-negative":[87],"constant":[88],"factor":[89,104,145],"f":[90,119],"edge-weight":[93],"as":[94,162,183],"extra":[96],"penalty.":[97],"Parameterizing":[98],"buyback":[103,144],"f,":[105],"our":[106,132,150],"main":[107],"result":[108],"obtaining":[110,135],"optimal":[111,168,174],"competitive":[112,169,175],"algorithms":[113,181],"for":[114,138],"all":[115],"possible":[116],"values":[117],"through":[120],"novel":[122],"primal-dual":[123,151],"family":[124],"algorithms.":[126],"We":[127],"establish":[128],"optimality":[130],"results":[133],"separate":[136],"lower-bounds":[137],"each":[139],"small":[141],"large":[143],"regimes,":[146],"showing":[148],"how":[149],"algorithm":[152],"exactly":[153],"matches":[154],"lower-bound":[156],"appropriately":[158],"tuning":[159],"parameter":[161],"function":[164],"f.":[166],"The":[167],"ratio":[170,176],"\u0393gen(f)":[171],"\u0393det-int(f)":[177],"deterministic":[179],"integral":[180],"are":[182],"follows,":[184]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}