{"id":"https://openalex.org/W7161721357","doi":"https://doi.org/10.48550/arxiv.2605.16791","title":"Improved Parallel Algorithms for EF1 Allocations","display_name":"Improved Parallel Algorithms for EF1 Allocations","publication_year":2026,"publication_date":"2026-05-16","ids":{"openalex":"https://openalex.org/W7161721357","doi":"https://doi.org/10.48550/arxiv.2605.16791"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.16791","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.16791","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2605.16791","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061083611","display_name":"Kishen N. Gowda","orcid":"https://orcid.org/0000-0001-6573-9445"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gowda, Kishen N","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136494807","display_name":"D Ellis Hershkowitz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hershkowitz, D Ellis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102109701","display_name":"Richard Z Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Richard Z","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5045114890","display_name":"Gregory Kehne","orcid":"https://orcid.org/0009-0002-3375-5576"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kehne, Gregory","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"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/T10991","display_name":"Game Theory and Voting Systems","score":0.7973999977111816,"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.7973999977111816,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.10350000113248825,"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/T11182","display_name":"Auction Theory and Applications","score":0.03869999945163727,"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/constant","display_name":"Constant (computer programming)","score":0.6845999956130981},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6359000205993652},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5719000101089478},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.47189998626708984},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45809999108314514},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.40380001068115234},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3921000063419342},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.3637999892234802}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6845999956130981},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6359000205993652},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5723999738693237},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5719000101089478},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5148000121116638},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.47189998626708984},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45809999108314514},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.40380001068115234},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3921000063419342},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.3637999892234802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35519999265670776},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.3425000011920929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33709999918937683},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2784000039100647},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.2531000077724457},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.16791","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.16791","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.16791","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.16791","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":{"Allocating":[0],"$m$":[1],"indivisible":[2],"goods":[3,67,155,219],"among":[4],"$n$":[5],"agents":[6,117],"is":[7,71,159,221],"a":[8],"fundamental":[9],"task":[10],"in":[11,227,233],"fair":[12],"division.":[13],"Recent":[14],"work":[15,104],"of":[16,25,85,126,141,184,203],"Garg":[17,185],"and":[18,41,68,102,136,156,166,186],"Psomas":[19,187],"[AAMAS":[20],"2025]":[21],"initiated":[22],"the":[23,51,83,91,103,182,196,201],"study":[24],"parallel":[26],"algorithms":[27,38,121,132,147,168,180],"for":[28,39,49,56,122,223,236],"envy-free":[29,215],"up":[30,216],"to":[31,99,109,217],"one":[32],"good":[33,70,158],"(EF1)":[34],"allocations,":[35,58,210],"giving":[36,119],"NC":[37,120,146],"$2$":[40,86],"$3$":[42,66,76,116],"agents.":[43,77,127],"They":[44],"also":[45,129,194],"showed":[46],"CC-hardness":[47,183,198],"results":[48],"simulating":[50,190,204],"classic":[52],"Round":[53,191,205],"Robin":[54],"algorithm":[55],"EF1":[57,209],"even":[59],"when":[60,169],"each":[61,69,149,157,170],"agent":[62,150,171],"values":[63,151,172],"at":[64,74,152,162,173],"most":[65,75,153,163,174],"valued":[72,160],"by":[73,118,161,188,199],"We":[78,128,193],"strengthen":[79],"these":[80,142],"results.":[81],"For":[82],"case":[84],"agents,":[87,165],"we":[88,112,144,211],"quadratically":[89],"improve":[90],"depth":[92,134,235],"from":[93,105],"$O(\\log":[94,100],"^":[95],"2":[96],"m)":[97],"$":[98],"m)$":[101,108],"$O(m":[106],"\\log":[107],"$O(m)$.":[110],"Furthermore,":[111],"significantly":[113],"generalize":[114],"beyond":[115,208],"any":[123,237],"constant":[124,238],"number":[125],"give":[130],"randomized":[131],"with":[133],"$\\tilde{O}(m/n)$":[135],"polynomial":[137],"work.":[138],"As":[139,177],"corollaries":[140],"results,":[143],"obtain":[145],"whenever":[148],"$polylog(m)$":[154,175],"$O(1)$":[164],"RNC":[167],"goods.":[176],"such,":[178],"our":[179],"bypass":[181],"not":[189],"Robin.":[192,206],"complement":[195],"aforementioned":[197],"showing":[200],"CC-completeness":[202],"Lastly,":[207],"show":[212],"that":[213],"computing":[214],"$k$":[218],"allocations":[220],"possible":[222],"$k":[224,230],"\\approx":[225],"\\sqrt{m}$":[226],"RNC,":[228],"or":[229],"=":[231],"m^{\\varepsilon}$":[232],"sublinear":[234],"$\\varepsilon":[239],">":[240],"0$.":[241]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-20T00:00:00"}