{"id":"https://openalex.org/W7213425957","doi":"https://doi.org/10.24963/ijcai.2026/381","title":"Computing Epistemtic EF1 and Pareto-Optimal Allocations of Indivisible Chores","display_name":"Computing Epistemtic EF1 and Pareto-Optimal Allocations of Indivisible Chores","publication_year":2026,"publication_date":"2026-09-01","ids":{"openalex":"https://openalex.org/W7213425957","doi":"https://doi.org/10.24963/ijcai.2026/381"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2026/381","doi":"https://doi.org/10.24963/ijcai.2026/381","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2026/381","pdf_url":"https://www.ijcai.org/proceedings/2026/0381.pdf","source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.ijcai.org/proceedings/2026/0381.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077432617","display_name":"Jugal Garg","orcid":"https://orcid.org/0000-0001-6439-7308","observed_orcids":["https://orcid.org/0000-0001-6439-7308"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jugal Garg","raw_affiliation_strings":["University of Illinois Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049544227","display_name":"Aniket Murhekar","orcid":"https://orcid.org/0000-0002-5995-471X","observed_orcids":["https://orcid.org/0000-0002-5995-471X"]},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aniket Murhekar","raw_affiliation_strings":["Northwestern University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern University","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.71523509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3427","last_page":"3435"},"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.9994999766349792,"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.9994999766349792,"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":9.999999747378752e-05,"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":0.0,"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/indivisible-chores","display_name":"indivisible chores","score":0.9380000233650208},{"id":"https://openalex.org/keywords/pareto-optimality","display_name":"Pareto optimality","score":0.8920000195503235},{"id":"https://openalex.org/keywords/fair-division","display_name":"fair division","score":0.7360000014305115},{"id":"https://openalex.org/keywords/competitive-equilibrium","display_name":"competitive equilibrium","score":0.7009999752044678},{"id":"https://openalex.org/keywords/pseudo-polynomial-time-algorithm","display_name":"pseudo-polynomial time algorithm","score":0.8399999737739563}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6725000143051147},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5892999768257141},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.47620001435279846},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4699000120162964},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.4578999876976013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3961000144481659},{"id":"https://openalex.org/C2776608160","wikidata":"https://www.wikidata.org/wiki/Q4785462","display_name":"Natural (archaeology)","level":2,"score":0.38089999556541443},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3783999979496002},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34790000319480896},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.33739998936653137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3009999990463257},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27140000462532043},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.27079999446868896}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2026/381","doi":"https://doi.org/10.24963/ijcai.2026/381","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2026/381","pdf_url":"https://www.ijcai.org/proceedings/2026/0381.pdf","source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2026/381","doi":"https://doi.org/10.24963/ijcai.2026/381","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2026/381","pdf_url":"https://www.ijcai.org/proceedings/2026/0381.pdf","source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"No poverty","score":0.41670000553131104,"id":"https://metadata.un.org/sdg/1"}],"study_designs":[],"awards":[{"id":"https://openalex.org/G1496995526","display_name":"AF:RI:Small: Fairness in allocation and machine learning problems: algorithms and solution concepts","funder_award_id":"2334461","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7213425957.pdf","grobid_xml":"https://content.openalex.org/works/W7213425957.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W4404352938","https://openalex.org/W4407212372"],"related_works":["https://openalex.org/W4385764248","https://openalex.org/W4401023457","https://openalex.org/W3207890361","https://openalex.org/W7124294025","https://openalex.org/W4385764400","https://openalex.org/W4402625064","https://openalex.org/W7118463301","https://openalex.org/W4396847329","https://openalex.org/W4401025054","https://openalex.org/W3175458960"],"abstract_inverted_index":{"We":[0],"study":[1,64],"the":[2,15,26,33,63,78,102,160,173,181],"allocation":[3,37,59,84,126],"of":[4,18,29,35,65,68,80,104,127,176],"m":[5,154],"indivisible":[6],"chores":[7,128],"among":[8],"n":[9],"agents":[10,105],"with":[11],"additive":[12],"disutilities":[13],"under":[14],"fairness":[16],"notion":[17,28],"envy-freeness":[19],"up":[20],"to":[21,87,100],"one":[22],"chore":[23],"(EF1)":[24],"and":[25,41,133,150,155,164,179],"efficiency":[27],"Pareto-optimality":[30],"(PO).":[31],"Although":[32],"existence":[34],"an":[36,52,58,83,125,137],"satisfying":[38],"both":[39,131,171],"EF1":[40,90,178],"PO":[42],"was":[43],"recently":[44],"established":[45],"using":[46],"a":[47,74,119],"highly":[48],"non-constructive":[49],"fixed-point":[50],"argument,":[51],"effective":[53],"algorithm":[54,122,140],"for":[55,93,123,141],"computing":[56,124],"such":[57,109],"remains":[60],"elusive,":[61],"prompting":[62],"meaningful":[66],"relaxations":[67],"these":[69],"desiderata.":[70],"Prior":[71],"work":[72],"introduced":[73],"natural":[75],"relaxation":[76],"through":[77],"concept":[79],"epistemic":[81,89,177],"fairness:":[82],"is":[85,98,130],"said":[86],"be":[88],"(EEF1),":[91],"if":[92],"every":[94],"agent":[95],"i,":[96],"it":[97,183],"possible":[99],"re-allocate":[101],"bundles":[103],"other":[106],"than":[107],"i":[108,111],"that":[110,129,170],"becomes":[112],"EF1.":[113],"In":[114],"this":[115],"work,":[116],"we":[117],"present":[118],"pseudo-polynomial":[120],"time":[121],"EEF1":[132],"PO.":[134],"This":[135],"gives":[136],"efficient":[138],"polynomial-time":[139],"most":[142],"practical":[143],"settings":[144],"where":[145],"disutility":[146],"values":[147],"are":[148],"integral":[149],"polynomially":[151],"bounded":[152],"in":[153],"n.":[156],"Our":[157],"result":[158],"employs":[159],"competitive":[161],"equilibrium":[162],"framework":[163],"relies":[165],"on":[166],"several":[167],"technical":[168],"insights":[169],"utilize":[172],"distinct":[174],"structure":[175],"address":[180],"challenges":[182],"introduces.":[184]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2026-09-17T00:00:00"}