{"id":"https://openalex.org/W7133195057","doi":"https://doi.org/10.48550/arxiv.2602.24042","title":"Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation","display_name":"Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation","publication_year":2026,"publication_date":"2026-02-27","ids":{"openalex":"https://openalex.org/W7133195057","doi":"https://doi.org/10.48550/arxiv.2602.24042"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.24042","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.24042","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.24042","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5127803049","display_name":"Zohar Barak","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Barak, Zohar","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5127807440","display_name":"Inbbal Talgam-Cohen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Talgam-Cohen, Inbal","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5127803049"],"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.2685999870300293,"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.2685999870300293,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.1720000058412552,"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/T12176","display_name":"Optimization and Packing Problems","score":0.10209999978542328,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7947999835014343},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.6937999725341797},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.6033999919891357},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.48489999771118164},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4528999924659729},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43230000138282776},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.38190001249313354},{"id":"https://openalex.org/keywords/stochastic-ordering","display_name":"Stochastic ordering","score":0.36419999599456787}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7947999835014343},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.6937999725341797},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.6033999919891357},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5116999745368958},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.48489999771118164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4706999957561493},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4528999924659729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4415999948978424},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.38190001249313354},{"id":"https://openalex.org/C32645036","wikidata":"https://www.wikidata.org/wiki/Q475164","display_name":"Stochastic ordering","level":2,"score":0.36419999599456787},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.359499990940094},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.3328999876976013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.313400000333786},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2639000117778778},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2563000023365021},{"id":"https://openalex.org/C2779545769","wikidata":"https://www.wikidata.org/wiki/Q5135364","display_name":"Closeness","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.24042","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.24042","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":"doi:10.48550/arxiv.2602.24042","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.24042","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6990243196487427}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"stochastic":[1,60,259],"combinatorial":[2,260],"optimization,":[3],"algorithms":[4],"differ":[5],"in":[6,82,226,257],"their":[7],"adaptivity:":[8],"whether":[9],"or":[10,73,183],"not":[11],"they":[12],"query":[13,184,229],"realized":[14],"randomness":[15],"and":[16,58,90,121,124,131,151,167,198],"adapt":[17],"to":[18,37,138,180,244,252],"it.":[19],"Dean":[20,50,144],"et":[21,51,145],"al.":[22,146],"(FOCS":[23],"'04)":[24],"formalize":[25],"the":[26,31,44,69,78,92,95,101,111,140,155,171,196,208,217,222,253],"adaptivity":[27,156,176,187],"gap,":[28,220],"which":[29,83],"compares":[30],"performance":[32],"of":[33,39,49,97,103,113,143,235,255],"fully":[34,129],"adaptive":[35,105,130,246],"policies":[36],"that":[38,173],"non-adaptive":[40,122,166],"ones.":[41],"We":[42,75,99,194,211],"revisit":[43],"fundamental":[45],"Stochastic":[46],"Knapsack":[47],"problem":[48,93],"al.,":[52],"where":[53],"items":[54,65],"have":[55],"deterministic":[56],"values":[57],"independent":[59],"sizes.":[61],"A":[62],"policy":[63],"packs":[64],"sequentially,":[66],"stopping":[67],"at":[68],"first":[70,135],"knapsack":[71],"overflow":[72,85],"before.":[74],"focus":[76],"on":[77,154],"challenging":[79],"risky":[80],"variant,":[81],"an":[84],"forfeits":[86],"all":[87],"accumulated":[88],"value,":[89],"study":[91,254],"through":[94,110],"lens":[96],"semi-adaptivity:":[98],"measure":[100],"power":[102],"$k$":[104,109,205],"queries":[106,206],"for":[107],"constant":[108],"notions":[112],"$0$-$k$":[114],"semi-adaptivity":[115,126,200,219,256],"gap":[116,118,127],"(the":[117],"between":[119,165],"$k$-semi-adaptive":[120,132],"policies),":[123],"$k$-$n$":[125,199],"(between":[128],"policies).":[133],"Our":[134,158],"contribution":[136,160],"is":[137,161,177],"improve":[139],"classic":[141],"results":[142],"by":[147,215],"giving":[148],"tighter":[149],"upper":[150],"lower":[152],"bounds":[153,214],"gap.":[157],"second":[159],"a":[162,190,227,240],"smoother":[163],"interpolation":[164],"fully-adaptive":[168,209],"policies,":[169],"with":[170,249],"rationale":[172],"when":[174],"full":[175],"unrealistic":[178],"(due":[179],"its":[181],"complexity":[182],"cost),":[185],"limited":[186],"may":[188],"be":[189],"desirable":[191],"middle":[192],"ground.":[193],"quantify":[195],"$1$-$n$":[197],"gaps,":[201],"showing":[202],"how":[203],"well":[204],"approximate":[207],"policy.":[210],"complement":[212],"these":[213],"quantifying":[216],"$0$-$1$":[218],"i.e.,":[221],"improvement":[223],"from":[224],"investing":[225],"single":[228],"over":[230],"no":[231],"adaptivity.":[232],"As":[233],"part":[234],"our":[236],"analysis,":[237],"we":[238],"develop":[239],"3-step":[241],"\"Simplify-Equalize-Optimize\"":[242],"approach":[243],"analyzing":[245],"decision":[247],"trees,":[248],"possible":[250],"applications":[251],"additional":[258],"optimization":[261],"problems.":[262]},"counts_by_year":[],"updated_date":"2026-03-04T07:04:00.330322","created_date":"2026-03-03T00:00:00"}