{"id":"https://openalex.org/W4417281215","doi":"https://doi.org/10.48550/arxiv.2503.10830","title":"Balanced and Fair Partitioning of Friends","display_name":"Balanced and Fair Partitioning of Friends","publication_year":2025,"publication_date":"2025-03-13","ids":{"openalex":"https://openalex.org/W4417281215","doi":"https://doi.org/10.48550/arxiv.2503.10830"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2503.10830","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.10830","pdf_url":"https://arxiv.org/pdf/2503.10830","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2503.10830","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048361071","display_name":"Argyrios Deligkas","orcid":"https://orcid.org/0000-0002-6513-6748"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Deligkas, Argyrios","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066848088","display_name":"Eduard Eiben","orcid":"https://orcid.org/0000-0003-2628-3435"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eiben, Eduard","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5117111865","display_name":"Stavros D. Ioannidis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ioannidis, Stavros D.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073361240","display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Knop, Du\u0161an","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5017702198","display_name":"\u0160imon Schierreich","orcid":"https://orcid.org/0000-0001-8901-1942"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schierreich, \u0160imon","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5048361071"],"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.7580000162124634,"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.7580000162124634,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.05420000106096268,"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.03200000151991844,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fair-division","display_name":"Fair division","score":0.586899995803833},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5113000273704529},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47290000319480896},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4397999942302704},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41429999470710754},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.3944000005722046},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3917999863624573},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.37459999322891235}],"concepts":[{"id":"https://openalex.org/C184659173","wikidata":"https://www.wikidata.org/wiki/Q1511081","display_name":"Fair division","level":2,"score":0.586899995803833},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5113000273704529},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4814000129699707},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47290000319480896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45660001039505005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4438999891281128},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4397999942302704},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41429999470710754},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3944000005722046},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3917999863624573},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.37459999322891235},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3625999987125397},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.35659998655319214},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3255000114440918},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.3176000118255615},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.30169999599456787},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C2778571376","wikidata":"https://www.wikidata.org/wiki/Q1355821","display_name":"Frontier","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C2992947560","wikidata":"https://www.wikidata.org/wiki/Q5167661","display_name":"Fair share","level":2,"score":0.25380000472068787}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2503.10830","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.10830","pdf_url":"https://arxiv.org/pdf/2503.10830","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2503.10830","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2503.10830","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:2503.10830","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.10830","pdf_url":"https://arxiv.org/pdf/2503.10830","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"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],"the":[1,18,26,29,36,46,55,88,95,123,143,146,152,161],"recently":[2],"introduced":[3],"model":[4,90,153],"of":[5,8,14,20,48,57,145,151,160],"fair":[6,124],"partitioning":[7],"friends,":[9],"there":[10],"is":[11,33,66,110],"a":[12,52,83],"set":[13],"agents":[15,96],"located":[16],"on":[17],"vertices":[19],"an":[21,49,80,156],"underlying":[22],"graph":[23,37],"that":[24,45,62,70,97,118],"indicates":[25],"friendships":[27],"between":[28],"agents.":[30],"The":[31,64],"task":[32],"to":[34,67,78,127],"partition":[35],"into":[38],"$k$":[39],"balanced-sized":[40],"groups,":[41],"keeping":[42],"in":[43,61,82,122],"mind":[44],"value":[47],"agent":[50,75,81],"for":[51,94,164],"group":[53],"equals":[54],"number":[56],"edges":[58],"they":[59],"have":[60,119],"group.":[63,85],"goal":[65],"construct":[68],"partitions":[69],"are":[71,98],"\"fair\",":[72],"i.e.,":[73],"no":[74],"would":[76],"like":[77],"replace":[79],"different":[84],"We":[86],"generalize":[87],"standard":[89],"by":[91,137],"considering":[92],"utilities":[93],"beyond":[99],"binary":[100],"and":[101,154],"additive.":[102],"Having":[103],"this":[104],"as":[105],"our":[106,108,128,165],"foundation,":[107],"contribution":[109],"threefold":[111],"(a)":[112],"we":[113,131,141],"adapt":[114],"several":[115,133],"fairness":[116,166],"notions":[117],"been":[120],"developed":[121],"division":[125],"literature":[126],"setting;":[129],"(b)":[130],"give":[132],"existence":[134],"guarantees":[135],"supported":[136],"polynomial-time":[138],"algorithms;":[139],"(c)":[140],"initiate":[142],"study":[144],"computational":[147],"(and":[148],"parameterized)":[149],"complexity":[150],"provide":[155],"almost":[157],"complete":[158],"landscape":[159],"(in)tractability":[162],"frontier":[163],"concepts.":[167]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}