{"id":"https://openalex.org/W7214712512","doi":"https://doi.org/10.48550/arxiv.2609.34121","title":"Online Stochastic Allocation with Increasing Returns","display_name":"Online Stochastic Allocation with Increasing Returns","publication_year":2026,"publication_date":"2026-09-28","ids":{"openalex":"https://openalex.org/W7214712512","doi":"https://doi.org/10.48550/arxiv.2609.34121"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.34121","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.34121","pdf_url":"https://arxiv.org/pdf/2609.34121","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.34121","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5153478716","display_name":"Shuo Sun","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sun, Shuo","raw_affiliation_strings":["The University of Wisconsin-Madison ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Wisconsin-Madison ,","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065079697","display_name":"Yunduan Lin","orcid":"https://orcid.org/0000-0001-9155-3652","observed_orcids":["https://orcid.org/0000-0001-9155-3652"]},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Lin, Yunduan","raw_affiliation_strings":["The Chinese University of Hong Kong ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong ,","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.00019999999494757503,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":9.999999747378752e-05,"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/online-allocation","display_name":"online allocation","score":0.8790000081062317},{"id":"https://openalex.org/keywords/increasing-returns","display_name":"increasing returns","score":0.9879999756813049},{"id":"https://openalex.org/keywords/stochastic-scheduling","display_name":"stochastic scheduling","score":0.550000011920929},{"id":"https://openalex.org/keywords/competitive-ratio","display_name":"competitive ratio","score":0.7670000195503235},{"id":"https://openalex.org/keywords/lp-rounding","display_name":"LP rounding","score":0.7110000252723694},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.7509999871253967}],"concepts":[{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6552000045776367},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6255000233650208},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6158999800682068},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5928000211715698},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5771999955177307},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.536300003528595},{"id":"https://openalex.org/C195487862","wikidata":"https://www.wikidata.org/wiki/Q850210","display_name":"Revenue","level":2,"score":0.5238000154495239},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.5047000050544739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4941999912261963},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4799000024795532},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4300000071525574},{"id":"https://openalex.org/C30600047","wikidata":"https://www.wikidata.org/wiki/Q7828141","display_name":"Total revenue","level":3,"score":0.4027999937534332},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4002000093460083},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3880999982357025},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.35530000925064087},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34310001134872437},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.33649998903274536},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31290000677108765},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2921999990940094},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C2777742833","wikidata":"https://www.wikidata.org/wiki/Q1964083","display_name":"Reciprocal","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.2597000002861023},{"id":"https://openalex.org/C19351080","wikidata":"https://www.wikidata.org/wiki/Q1395034","display_name":"New product development","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C3017552255","wikidata":"https://www.wikidata.org/wiki/Q4135208","display_name":"Arrival time","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.2529999911785126}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.34121","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.34121","pdf_url":"https://arxiv.org/pdf/2609.34121","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.34121","doi":"https://doi.org/10.48550/arxiv.2609.34121","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.34121","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,"listed_in":[],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.34121","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.34121","pdf_url":"https://arxiv.org/pdf/2609.34121","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214712512.pdf","grobid_xml":"https://content.openalex.org/works/W7214712512.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W2131951207","https://openalex.org/W2158268067","https://openalex.org/W2162656786","https://openalex.org/W2170675255","https://openalex.org/W2571343094","https://openalex.org/W2973115103","https://openalex.org/W3122992687","https://openalex.org/W4247154108","https://openalex.org/W4292022450","https://openalex.org/W4382197689"],"related_works":["https://openalex.org/W7090988925","https://openalex.org/W7118532584","https://openalex.org/W7168277984","https://openalex.org/W2913482265","https://openalex.org/W7098980681","https://openalex.org/W3004937659","https://openalex.org/W4286418628","https://openalex.org/W2978053008","https://openalex.org/W7171449736","https://openalex.org/W4417125263"],"abstract_inverted_index":{"We":[0,84,104],"study":[1],"online":[2,133],"allocation":[3,188],"with":[4,23,101,213],"increasing":[5,59],"returns,":[6,60],"where":[7,143],"an":[8],"uncertain":[9],"number":[10,40,147],"of":[11,41,125,148,162,216],"customers":[12],"arrive":[13],"sequentially":[14],"and":[15,91,167,194,210,218],"can":[16,68,96,135],"be":[17,78],"irrevocably":[18],"assigned":[19],"to":[20,44,111,231],"any":[21],"product":[22,76],"remaining":[24],"capacity.":[25],"Each":[26],"assignment":[27],"earns":[28],"a":[29,33,74,121,137,176,182,186,199,233],"base":[30],"reward":[31],"plus":[32],"bonus":[34,156],"that":[35,65,86,179],"is":[36,64,145],"nondecreasing":[37],"in":[38,164,198],"the":[39,45,61,112,146,155,160,191],"previous":[42],"assignments":[43,67,166,197],"same":[46],"product.":[47],"Prior":[48],"work":[49],"has":[50],"focused":[51],"primarily":[52],"on":[53,154],"fixed":[54],"or":[55],"diminishing":[56],"returns.":[57],"Under":[58,171],"central":[62],"challenge":[63],"concentrating":[66],"unlock":[69],"large":[70],"future":[71],"rewards,":[72],"while":[73],"different":[75],"may":[77],"preferable":[79],"if":[80],"arrivals":[81],"stop":[82],"early.":[83],"show":[85],"classical":[87],"approaches,":[88],"including":[89],"greedy":[90],"natural":[92],"LP-based":[93],"rounding":[94],"algorithms,":[95],"perform":[97],"arbitrarily":[98],"poorly,":[99],"even":[100],"homogeneous":[102,117],"bonuses.":[103],"evaluate":[105],"performance":[106],"through":[107],"competitive":[108,123,138,214],"ratios":[109,215],"relative":[110],"hindsight":[113],"offline":[114],"optimum.":[115],"For":[116,127,202,221],"bonuses,":[118,130],"we":[119,158,174,206,227],"establish":[120],"tight":[122],"ratio":[124,139],"$1/2$.":[126],"arbitrary":[128,203],"heterogeneous":[129],"however,":[131],"no":[132],"algorithm":[134],"guarantee":[136],"greater":[140],"than":[141],"$1/m$,":[142],"$m$":[144],"products.":[149],"By":[150],"imposing":[151],"discrete":[152],"concavity":[153],"functions,":[157],"limit":[159],"concentration":[161],"rewards":[163],"later":[165],"restore":[168],"constant":[169],"guarantees.":[170],"this":[172],"structure,":[173],"develop":[175],"re-solving":[177],"framework":[178],"repeatedly":[180],"selects":[181],"planning":[183],"horizon,":[184],"constructs":[185],"feasible":[187],"plan":[189],"from":[190],"current":[192],"state,":[193],"executes":[195],"its":[196],"specific":[200],"order.":[201],"arrival":[204,225],"distributions,":[205,226],"design":[207],"distribution-oblivious":[208],"deterministic":[209,234],"randomized":[211],"algorithms":[212],"$0.2537$":[217],"$0.3864$,":[219],"respectively.":[220],"known":[222],"increasing-failure-rate":[223],"(IFR)":[224],"exploit":[228],"distributional":[229],"information":[230],"obtain":[232],"$1/2$-competitive":[235],"algorithm.":[236]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-09-30T00:00:00"}
