{"id":"https://openalex.org/W7131318506","doi":"https://doi.org/10.48550/arxiv.2602.18610","title":"Strengths and Limitations of Greedy in Cup Games","display_name":"Strengths and Limitations of Greedy in Cup Games","publication_year":2026,"publication_date":"2026-02-20","ids":{"openalex":"https://openalex.org/W7131318506","doi":"https://doi.org/10.48550/arxiv.2602.18610"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.18610","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.18610","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.18610","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057256828","display_name":"Kalina Jasi\u0144ska","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jasi\u0144ska, Kalina","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126722512","display_name":"John Kuszmaul","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kuszmaul, John","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126681149","display_name":"Gyudong Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee, Gyudong","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057256828"],"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4250999987125397,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4250999987125397,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.06960000097751617,"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/T10237","display_name":"Cryptography and Data Security","score":0.06319999694824219,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7174000144004822},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.6208999752998352},{"id":"https://openalex.org/keywords/trimming","display_name":"Trimming","score":0.5855000019073486},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5734999775886536},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5306000113487244},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5023999810218811},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.44620001316070557},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42320001125335693}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7174000144004822},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.6208999752998352},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5867000222206116},{"id":"https://openalex.org/C56951928","wikidata":"https://www.wikidata.org/wiki/Q3539213","display_name":"Trimming","level":2,"score":0.5855000019073486},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5734999775886536},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5306000113487244},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5023999810218811},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49779999256134033},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.44620001316070557},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42320001125335693},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41510000824928284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4115999937057495},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.37310001254081726},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3122999966144562},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.2939999997615814},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2770000100135803},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.25429999828338623}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.18610","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.18610","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.18610","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.18610","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":[],"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,32,122],"the":[1,33,37,44,47,54,63,90,98,110,117,133,136,140,159,168,173,180,198,204,209,217,220,241,253,262,278],"cup":[2,23,56,92,161,175,200,234,264,280],"game,":[3,162,201],"an":[4,232,288],"adversary":[5,38],"distributes":[6],"1":[7,28],"unit":[8,29],"of":[9,30,114,130,135,142,208,212,219,240,259,274],"water":[10],"among":[11],"$n$":[12],"cups":[13],"every":[14],"time":[15],"step.":[16],"The":[17,76,101],"player":[18,48,205],"then":[19],"selects":[20],"a":[21,127,147,150,195,236,257],"single":[22],"from":[24],"which":[25,153,203,226],"to":[26,52,85,108,296],"remove":[27],"water.":[31],"bamboo":[34,99,118,169],"trimming":[35,170],"problem,":[36],"must":[39],"choose":[40],"fixed":[41],"rates":[42],"for":[43,132,167],"cups,":[45],"and":[46,73,94,163,172,248,271,304],"is":[49,70,206,293],"additionally":[50],"allowed":[51],"empty":[53],"chosen":[55],"entirely.":[57],"Past":[58],"work":[59,84],"has":[60,79,104],"shown":[61,81],"that":[62,183,252,286],"optimal":[64,88,96,112,166,186],"backlog":[65,113,134,155,258,298],"in":[66,82,89,97,116,158,202,223,261,277,287],"these":[67],"two":[68],"settings":[69],"$\u0398(\\log":[71,299],"n)$":[72,157],"2":[74,115],"respectively.":[75],"greedy":[77,102,137,221,254,292],"algorithm":[78,103,182,222,255],"been":[80,105],"previous":[83],"be":[86,228],"exactly":[87,111,165],"general":[91,160],"game":[93,176],"asymptotically":[95,185],"setting.":[100],"conjectured":[106],"[16]":[107],"achieve":[109,297],"setting":[119],"as":[120,230],"well.":[121],"this":[123,178,224],"paper,":[124],"we":[125,193,284],"prove":[126,245],"lower":[128,249,272,305],"bound":[129],"$2.076$":[131],"algorithm,":[138,149],"disproving":[139],"conjecture":[141],"[16].":[143],"We":[144,215,244,266],"also":[145,267],"introduce":[146,194],"new":[148,196],"hybrid":[151],"greedy/Deadline-Driven,":[152],"achieves":[154,184,256],"$O(\\log":[156],"remains":[164],"problem":[171],"fixed-rate":[174],"--":[177],"constitutes":[179],"first":[181],"performance":[187,218],"across":[188],"all":[189],"three":[190],"settings.":[191],"Additionally,":[192],"model,":[197],"semi-oblivious":[199,263,279],"uncertain":[207],"exact":[210],"heights":[211],"each":[213],"cup.":[214,243],"analyze":[216],"setting,":[225,291],"can":[227],"viewed":[229],"selecting":[231],"arbitrary":[233],"within":[235],"constant":[237],"multiplicative":[238],"factor":[239],"fullest":[242],"matching":[246,269,302],"upper":[247,270,303],"bounds":[250,273],"showing":[251],"$\u0398(n^{\\frac{c-1}{c}})$":[260],"game.":[265,282],"establish":[268],"$2^{\u0398(\\sqrt{\\log":[275],"n})}$":[276],"flushing":[281],"Finally,":[283],"show":[285],"additive":[289],"error":[290],"actually":[294],"able":[295],"n)$,":[300],"via":[301],"bounds.":[306]},"counts_by_year":[],"updated_date":"2026-02-25T06:22:25.187761","created_date":"2026-02-25T00:00:00"}