{"id":"https://openalex.org/W4376654117","doi":"https://doi.org/10.48550/arxiv.2305.08622","title":"Size-stochastic Knapsack Online Contention Resolution Schemes","display_name":"Size-stochastic Knapsack Online Contention Resolution Schemes","publication_year":2023,"publication_date":"2023-05-15","ids":{"openalex":"https://openalex.org/W4376654117","doi":"https://doi.org/10.48550/arxiv.2305.08622"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2305.08622","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2305.08622","pdf_url":"https://arxiv.org/pdf/2305.08622","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2305.08622","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104117194","display_name":"Toru Yoshinaga","orcid":"https://orcid.org/0009-0003-4725-1501"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yoshinaga, Toru","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5025634820","display_name":"Yasushi Kawase","orcid":"https://orcid.org/0000-0001-5626-779X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kawase, Yasushi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104117194"],"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.9994000196456909,"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.9994000196456909,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9977999925613403,"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.9773055911064148},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.695900559425354},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6908355355262756},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6046668291091919},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5357813835144043},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5062829256057739},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.45346298813819885},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.44073721766471863},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4288327097892761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36833426356315613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34369489550590515},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1205700933933258},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06761598587036133}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9773055911064148},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.695900559425354},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6908355355262756},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6046668291091919},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5357813835144043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5062829256057739},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.45346298813819885},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.44073721766471863},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4288327097892761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36833426356315613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34369489550590515},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1205700933933258},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06761598587036133},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2305.08622","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2305.08622","pdf_url":"https://arxiv.org/pdf/2305.08622","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2305.08622","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2305.08622","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":"pmh:oai:arXiv.org:2305.08622","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2305.08622","pdf_url":"https://arxiv.org/pdf/2305.08622","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4376654117.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W2005493932","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2145407993","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W4246202890"],"abstract_inverted_index":{"Online":[0],"contention":[1],"resolution":[2],"schemes":[3,16],"(OCRSs)":[4],"are":[5,55,64,97,118,128],"effective":[6],"rounding":[7],"techniques":[8],"for":[9,40],"online":[10,41],"stochastic":[11,42],"combinatorial":[12],"optimization":[13],"problems.":[14,45],"These":[15],"randomly":[17],"and":[18,61,120,145,173],"sequentially":[19,52],"round":[20],"a":[21,25,58,100],"fractional":[22],"solution":[23],"to":[24,75],"relaxed":[26],"problem":[27,48,73],"that":[28,115,147,175],"can":[29,150],"be":[30],"formulated":[31],"in":[32,90],"advance.":[33],"In":[34,46],"this":[35,176],"study,":[36],"we":[37,135,163],"propose":[38,164],"OCRSs":[39],"generalized":[43],"assignment":[44],"the":[47,72,77,82,86,91,94,110,121,131,159],"of":[49,71,143,171],"our":[50],"OCRSs,":[51],"arriving":[53],"items":[54,87,114,127],"packed":[56],"into":[57],"single":[59],"knapsack,":[60],"their":[62],"sizes":[63,96],"revealed":[65],"only":[66],"after":[67],"insertion.":[68],"The":[69],"goal":[70],"is":[74,81,177],"maximize":[76],"acceptance":[78,141,153,169],"probability,":[79],"which":[80],"smallest":[83],"probability":[84,142,154,170],"among":[85],"being":[88],"placed":[89],"knapsack.":[92],"Since":[93],"item":[95],"unknown":[98],"beforehand,":[99],"capacity":[101],"overflow":[102,117],"may":[103],"occur.":[104],"We":[105],"consider":[106],"two":[107],"distinct":[108],"settings:":[109],"hard":[111,132],"constraint,":[112],"where":[113,125],"cause":[116],"rejected,":[119],"soft":[122,160],"constraint":[123,133,161],"setting,":[124,134,162],"such":[126],"accepted.":[129],"Under":[130,158],"present":[136],"an":[137,140,152,165,168],"algorithm":[138,149,166],"with":[139,167],"$1/3$":[144],"prove":[146],"no":[148],"achieve":[151],"greater":[155],"than":[156],"$3/7$.":[157],"$1/2$":[172],"demonstrate":[174],"best":[178],"possible.":[179]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}