{"id":"https://openalex.org/W7213371012","doi":"https://doi.org/10.48550/arxiv.2609.13650","title":"Online Fair Division: Pushing the Frontier of Approximate Proportionality","display_name":"Online Fair Division: Pushing the Frontier of Approximate Proportionality","publication_year":2026,"publication_date":"2026-09-12","ids":{"openalex":"https://openalex.org/W7213371012","doi":"https://doi.org/10.48550/arxiv.2609.13650"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.13650","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.13650","pdf_url":"https://arxiv.org/pdf/2609.13650","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.13650","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033289922","display_name":"Yingjian Du","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I154099455","display_name":"Shandong University","ror":"https://ror.org/0207yh398","country_code":"CN","type":"education","lineage":["https://openalex.org/I154099455"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Du, Yingjian","raw_affiliation_strings":["School of Computer Science and Technology , Shandong University , Qingdao , China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology , Shandong University , Qingdao , China","institution_ids":["https://openalex.org/I154099455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123878398","display_name":"Ankang Sun","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I154099455","display_name":"Shandong University","ror":"https://ror.org/0207yh398","country_code":"CN","type":"education","lineage":["https://openalex.org/I154099455"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Sun, Ankang","raw_affiliation_strings":["School of Computer Science and Technology , Shandong University , Qingdao , China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology , Shandong University , Qingdao , China","institution_ids":["https://openalex.org/I154099455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154099455"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":3,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.926800012588501,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.926800012588501,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.07180000096559525,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":9.999999747378752e-05,"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/prop1","display_name":"PROP1","score":0.9509999752044678},{"id":"https://openalex.org/keywords/competitive-ratio","display_name":"competitive ratio","score":0.746999979019165},{"id":"https://openalex.org/keywords/deterministic-approximation","display_name":"deterministic approximation","score":0.49900001287460327},{"id":"https://openalex.org/keywords/advance-information","display_name":"advance information","score":0.6840000152587891},{"id":"https://openalex.org/keywords/additive-valuations","display_name":"additive valuations","score":0.6269999742507935},{"id":"https://openalex.org/keywords/two-agent-allocation","display_name":"two-agent allocation","score":0.3580000102519989}],"concepts":[{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.6575000286102295},{"id":"https://openalex.org/C183763965","wikidata":"https://www.wikidata.org/wiki/Q603959","display_name":"Proportionality (law)","level":2,"score":0.5637000203132629},{"id":"https://openalex.org/C184659173","wikidata":"https://www.wikidata.org/wiki/Q1511081","display_name":"Fair division","level":2,"score":0.5557000041007996},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4724999964237213},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4668000042438507},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.462799996137619},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.4422000050544739},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4361000061035156},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.41370001435279846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.412200003862381},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4090000092983246},{"id":"https://openalex.org/C60798267","wikidata":"https://www.wikidata.org/wiki/Q1226939","display_name":"Division (mathematics)","level":2,"score":0.3547999858856201},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C51485801","wikidata":"https://www.wikidata.org/wiki/Q16966861","display_name":"Efficient frontier","level":3,"score":0.3517000079154968},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.33660000562667847},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3328000009059906},{"id":"https://openalex.org/C2778571376","wikidata":"https://www.wikidata.org/wiki/Q1355821","display_name":"Frontier","level":2,"score":0.3174000084400177},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3091999888420105},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.3043999969959259},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.2653999924659729},{"id":"https://openalex.org/C3020013979","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimal allocation","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.13650","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.13650","pdf_url":"https://arxiv.org/pdf/2609.13650","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.13650","doi":"https://doi.org/10.48550/arxiv.2609.13650","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.13650","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.13650","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.13650","pdf_url":"https://arxiv.org/pdf/2609.13650","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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/W7213371012.pdf","grobid_xml":"https://content.openalex.org/works/W7213371012.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W7164939520"],"related_works":["https://openalex.org/W6929534532","https://openalex.org/W7211978765","https://openalex.org/W4414857702","https://openalex.org/W7214239013","https://openalex.org/W7214012922","https://openalex.org/W4385767422","https://openalex.org/W7171512972","https://openalex.org/W4226203987","https://openalex.org/W7164939520","https://openalex.org/W7214799464"],"abstract_inverted_index":{"Online":[0],"fair":[1],"division":[2],"captures":[3],"allocation":[4,28,45,67,138],"problems":[5],"in":[6,38],"which":[7,136],"indivisible":[8],"resources":[9,19],"arrive":[10],"over":[11],"time":[12],"and":[13,32,60,78,121,157,269],"must":[14],"be":[15,192],"assigned":[16],"before":[17],"future":[18,89],"are":[20,30,216,267],"known.":[21],"Understanding":[22],"what":[23],"fairness":[24],"remains":[25],"achievable":[26,85],"when":[27,148,265],"decisions":[29],"immediate":[31],"irrevocable":[33],"is":[34,58,104,153],"a":[35,93,185,220,233,258],"fundamental":[36],"question":[37,177],"this":[39,113],"setting.":[40],"We":[41,69,111,194,235],"study":[42,196],"deterministic":[43,94,126,187,221,260],"online":[44],"among":[46],"$n$":[47,120],"agents":[48,152,251],"with":[49,132,252],"nonnegative":[50],"additive":[51],"valuations,":[52],"where":[53,102,199],"the":[54,61,84,105,149,161,197,200,203,206,214,225,245],"number":[55,106,150],"of":[56,107,151,205,228],"goods":[57,108,134],"unknown":[59],"adversary":[62],"can":[63,191],"adapt":[64],"to":[65,74,232],"previous":[66],"decisions.":[68],"focus":[70],"on":[71,135,160,183,244],"proportionality":[72],"up":[73],"one":[75,243],"good":[76],"(PROP1)":[77],"examine":[79],"how":[80],"advance":[81],"information":[82],"affects":[83],"guarantees.":[86],"Without":[87],"additional":[88],"information,":[90],"we":[91,218,256],"give":[92,219,257],"algorithm":[95,127,201,261],"that":[96,262],"guarantees":[97,263],"$\u03a9(\\frac{1}{\\log(nm)})$-PROP1":[98],"after":[99],"every":[100,119,125,211],"round,":[101],"$m$":[103,133],"at":[109,166],"termination.":[110],"complement":[112],"result":[114],"by":[115,165,179],"showing":[116],"that,":[117],"for":[118,189,210,249,272],"sufficiently":[122],"large":[123],"$m$,":[124],"has":[128,139],"an":[129,168,175,238],"adaptive":[130],"instance":[131],"its":[137],"PROP1":[140,190],"approximation":[141,188],"guarantee":[142,227],"$O(\\frac{\\log":[143],"\\log":[144],"m}{\\log":[145],"m})$.":[146],"Thus,":[147],"fixed,":[154],"our":[155],"upper":[156,240],"lower":[158],"bounds":[159],"competitive":[162,246],"ratio":[163],"differ":[164],"most":[167],"$O(\\log\\log":[169],"m)$":[170],"factor.":[171],"These":[172],"results":[173],"answer":[174],"open":[176],"proposed":[178],"Choo":[180,229],"et":[181,230],"al.":[182,231],"whether":[184],"nontrivial":[186],"obtained.":[193],"also":[195],"setting":[198],"knows":[202],"predictions":[204,215,266],"maximum":[207],"item":[208],"value":[209],"agent.":[212],"When":[213],"accurate,":[217],"$\\frac{1}{2}$-PROP1":[222,264],"algorithm,":[223],"improving":[224],"$\\frac{1}{n}$":[226],"constant.":[234],"further":[236],"establish":[237],"explicit":[239],"bound":[241],"below":[242],"ratio,":[247],"even":[248],"two":[250],"accurate":[253,268],"predictions.":[254,274],"Finally,":[255],"single":[259],"$\u03a9(\\frac{1}{\\log":[270],"(nm)})$-PROP1":[271],"arbitrary":[273]},"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2026-09-16T00:00:00"}