{"id":"https://openalex.org/W4285091035","doi":"https://doi.org/10.1145/3490486.3538320","title":"Near-Optimal Bayesian Online Assortment of Reusable Resources","display_name":"Near-Optimal Bayesian Online Assortment of Reusable Resources","publication_year":2022,"publication_date":"2022-07-12","ids":{"openalex":"https://openalex.org/W4285091035","doi":"https://doi.org/10.1145/3490486.3538320"},"language":"en","primary_location":{"id":"doi:10.1145/3490486.3538320","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490486.3538320","pdf_url":null,"source":{"id":"https://openalex.org/S4363608973","display_name":"Proceedings of the 23rd ACM Conference on Economics and Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd 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/A5041757714","display_name":"Yiding Feng","orcid":"https://orcid.org/0000-0002-8258-6994"},"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"]},{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yiding Feng","raw_affiliation_strings":["Microsoft Research New England, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research New England, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}]},{"author_position":"middle","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":["University of Chicago Booth School of Business, Chicago, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Chicago Booth School of Business, Chicago, IL, USA","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001035442","display_name":"Amin Saberi","orcid":"https://orcid.org/0000-0002-7043-0722"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amin Saberi","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.0875,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.97889447,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"964","last_page":"965"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9955999851226807,"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.9693999886512756,"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/computer-science","display_name":"Computer science","score":0.8009254932403564},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.597183108329773},{"id":"https://openalex.org/keywords/revenue","display_name":"Revenue","score":0.5674474239349365},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5236855745315552},{"id":"https://openalex.org/keywords/renting","display_name":"Renting","score":0.47829967737197876},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.47317177057266235},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4613973796367645},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.4340723752975464},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43243926763534546},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.41889306902885437},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3583206236362457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2715938091278076},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13684985041618347}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8009254932403564},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.597183108329773},{"id":"https://openalex.org/C195487862","wikidata":"https://www.wikidata.org/wiki/Q850210","display_name":"Revenue","level":2,"score":0.5674474239349365},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5236855745315552},{"id":"https://openalex.org/C85502023","wikidata":"https://www.wikidata.org/wiki/Q157171","display_name":"Renting","level":2,"score":0.47829967737197876},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.47317177057266235},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4613973796367645},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4340723752975464},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43243926763534546},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.41889306902885437},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3583206236362457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2715938091278076},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13684985041618347},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"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/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3490486.3538320","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490486.3538320","pdf_url":null,"source":{"id":"https://openalex.org/S4363608973","display_name":"Proceedings of the 23rd ACM Conference on Economics and Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd ACM Conference on Economics and Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-141775","is_oa":false,"landing_page_url":"http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=&rft.volume=&rft.issue=&rft.date=2022&rft.spage=&rft.aulast=Feng&rft.aufirst=Yiding&rft.atitle=Near-Optimal+Bayesian+Online+Assortment+of+Reusable+Resources&rft.title=EC+%2722%3A+Proceedings+of+the+23rd+ACM+Conference+on+Economics+and+Computation","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":[{"id":"https://openalex.org/G2234605116","display_name":null,"funder_award_id":"CCF-1812919","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":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/W1930615501"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"the":[2,36,41,57,60,78,93,100,144,147,153,159,169,209,215],"applications":[3],"of":[4,16,22,62,81,156,158,165,172,203,211],"rental":[5],"services":[6],"in":[7,13,40,44,115,198],"e-commerce,":[8],"we":[9,127,180],"consider":[10],"revenue":[11,154],"maximization":[12],"online":[14,31,38],"assortment":[15,184],"reusable":[17,82],"resources":[18],"for":[19,77,92,138],"a":[20,72,116,163,166],"stream":[21],"arriving":[23],"consumers":[24],"with":[25,33,188],"different":[26],"types.":[27],"We":[28,206],"design":[29,133],"competitive":[30,75],"algorithms":[32,213],"respect":[34],"to":[35,132],"optimum":[37],"policy":[39],"Bayesian":[42],"setting,":[43],"which":[45,200],"types":[46],"are":[47],"drawn":[48],"independently":[49],"from":[50,120],"known":[51],"heterogeneous":[52],"distributions":[53],"over":[54],"time.":[55],"In":[56],"regime":[58],"where":[59],"minimum":[61],"initial":[63],"inventories":[64],"c_min":[65],"is":[66,71,110],"large,":[67],"our":[68,192,212],"main":[69,108],"result":[70],"near-optimal":[73],"1-min(1/2,\u221alog(cmin)/cmin)":[74],"algorithm":[76,85],"general":[79],"case":[80],"resources.":[83,160,174],"Our":[84],"relies":[86],"on":[87,218],"an":[88,103],"expected":[89],"LP":[90],"benchmark":[91],"problem,":[94],"solves":[95],"this":[96,125,177],"LP,":[97],"and":[98,152,190],"simulates":[99],"solution":[101],"through":[102],"independent":[104,204],"randomized":[105],"rounding.":[106],"The":[107],"challenge":[109],"obtaining":[111],"point-wise":[112],"inventory":[113,148],"feasibility":[114,149],"computationally":[117],"efficient":[118],"fashion":[119],"these":[121],"simulation-based":[122],"algorithms.":[123],"To":[124,175],"end,":[126],"use":[128],"several":[129],"technical":[130],"ingredients":[131],"discarding":[134,162,193],"policies":[135,142,194],"-":[136],"one":[137],"each":[139,157],"resource.":[140],"These":[141],"handle":[143,176],"trade-off":[145],"between":[146],"under":[150],"reusability":[151],"loss":[155],"However,":[161],"unit":[164],"resource":[167],"changes":[168],"future":[170],"consumption":[171],"other":[173],"new":[178],"challenge,":[179],"also":[181],"introduce":[182],"post-processing":[183],"procedures":[185],"that":[186],"help":[187],"designing":[189],"analyzing":[191],"as":[195],"they":[196],"run":[197],"parallel,":[199],"might":[201],"be":[202],"interest.":[205],"finally":[207],"evaluate":[208],"performance":[210],"using":[214],"numerical":[216],"simulations":[217],"synthetic":[219],"data.":[220]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}