{"id":"https://openalex.org/W7137889949","doi":"https://doi.org/10.1609/aaai.v40i20.38768","title":"Group Fair Matchings Using Convex Cost Functions","display_name":"Group Fair Matchings Using Convex Cost Functions","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7137889949","doi":"https://doi.org/10.1609/aaai.v40i20.38768"},"language":null,"primary_location":{"id":"doi:10.1609/aaai.v40i20.38768","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i20.38768","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/38768/42730","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/AAAI/article/download/38768/42730","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020799415","display_name":"Atasi Panda","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Atasi Panda","raw_affiliation_strings":["Indian Institute of Science"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035743390","display_name":"Harsh Sharma","orcid":"https://orcid.org/0000-0002-9862-6794"},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Harsh Sharma","raw_affiliation_strings":["Chennai Mathematical Institute"],"affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute","institution_ids":["https://openalex.org/I19149307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059653613","display_name":"Anand Louis","orcid":"https://orcid.org/0000-0002-4727-9219"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anand Louis","raw_affiliation_strings":["Indian Institute of Science"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129744625","display_name":"Prajakta Nimbhorkar","orcid":null},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prajakta Nimbhorkar","raw_affiliation_strings":["Chennai Mathematical Institute"],"affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute","institution_ids":["https://openalex.org/I19149307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5020799415"],"corresponding_institution_ids":["https://openalex.org/I59270414"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16129032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"20","first_page":"17179","last_page":"17187"},"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.6022999882698059,"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.6022999882698059,"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/T11031","display_name":"Game Theory and Applications","score":0.0722000002861023,"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"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.03590000048279762,"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/group","display_name":"Group (periodic table)","score":0.49390000104904175},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4900999963283539},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47360000014305115},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44999998807907104},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4219000041484833},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.36329999566078186},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.352400004863739},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3449999988079071}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6351000070571899},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.49390000104904175},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4900999963283539},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4797999858856201},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47360000014305115},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44999998807907104},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4219000041484833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3853999972343445},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.36329999566078186},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.352400004863739},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.3359000086784363},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32829999923706055},{"id":"https://openalex.org/C2780958618","wikidata":"https://www.wikidata.org/wiki/Q945621","display_name":"Average cost","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C182299520","wikidata":"https://www.wikidata.org/wiki/Q1289588","display_name":"Total cost","level":2,"score":0.29919999837875366},{"id":"https://openalex.org/C151913843","wikidata":"https://www.wikidata.org/wiki/Q3454555","display_name":"Dominance (genetics)","level":3,"score":0.2955000102519989},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.26919999718666077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.263700008392334}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v40i20.38768","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i20.38768","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/38768/42730","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i20.38768","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i20.38768","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/38768/42730","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7137889949.pdf","grobid_xml":"https://content.openalex.org/works/W7137889949.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,207,233],"consider":[1],"the":[2,19,34,62,74,145,148,152,157,170,190,204,248,251,255],"problem":[3,253],"of":[4,18,37,64,88,137,141,147,150,250],"assigning":[5],"items":[6,38,48,65],"to":[7,21,73,164],"platforms":[8,20,283],"where":[9,277],"each":[10,17,54,67],"item":[11],"has":[12,29,262],"a":[13,30,43,85,174,181,240],"utility":[14,176,205],"associated":[15],"with":[16,122,194,243,284],"which":[22],"it":[23,39],"can":[24,70,257],"be":[25,71,280],"assigned.":[26],"Each":[27],"platform":[28,55,192],"soft":[31,86],"constraint":[32],"over":[33,61],"total":[35,175],"number":[36,63],"serves,":[40],"modeled":[41],"via":[42],"convex":[44,59,200],"cost":[45,60,140,153,171,193,286],"function.":[46],"Additionally,":[47],"are":[49],"partitioned":[50],"into":[51],"groups,":[52],"and":[53,99,159,218,230,246,274,288],"also":[56,131,234],"incurs":[57],"group-specific":[58,195],"from":[66],"group":[68,79,108],"that":[69,168,177],"assigned":[72],"platform.":[75],"These":[76],"costs":[77],"promote":[78],"fairness":[80,89],"by":[81,199,215],"penalizing":[82],"imbalances,":[83],"yielding":[84],"variation":[87],"notions":[90],"introduced":[91],"in":[92,188,264],"prior":[93],"work,":[94],"such":[95,119],"as":[96],"Restricted":[97,102],"Dominance":[98,103],"Minority":[100,111],"protection.":[101],"enforces":[104,113],"upper":[105],"bounds":[106],"on":[107,225],"representation,":[109],"while":[110,172,202],"protection":[112],"lower":[114],"bounds.":[115],"Our":[116,129,221],"approach":[117],"replaces":[118],"hard":[120],"constraints":[121],"cost-based":[123],"penalties,":[124],"allowing":[125],"more":[126],"flexible":[127],"trade-offs.":[128],"model":[130],"captures":[132],"Nash":[133],"Social":[134],"Welfare":[135],"kind":[136],"objective.":[138],"The":[139,161,184],"an":[142,166,209,236],"assignment":[143,167],"is":[144,163,178,223],"sum":[146],"values":[149],"all":[151,156],"functions":[154],"across":[155,282],"groups":[158,256],"platforms.":[160],"objective":[162],"find":[165],"minimizes":[169],"achieving":[173],"at":[179],"least":[180],"user-specified":[182],"threshold.":[183],"main":[185],"challenge":[186],"lies":[187],"balancing":[189],"overall":[191],"costs,":[196],"both":[197],"governed":[198],"functions,":[201],"meeting":[203],"constraint.":[206],"present":[208],"efficient":[210],"polynomial-time":[211],"approximation":[212],"algorithm,":[213],"supported":[214],"theoretical":[216],"guarantees":[217],"experimental":[219],"evaluation.":[220],"algorithm":[222,238],"based":[224],"techniques":[226],"involving":[227],"linear":[228],"programming":[229],"network":[231,275],"flows.":[232],"provide":[235],"exact":[237],"for":[239],"special":[241],"case":[242],"uniform":[244],"utilities":[245],"establish":[247],"hardness":[249],"general":[252],"when":[254],"intersect":[258],"arbitrarily.":[259],"This":[260],"work":[261],"applications":[263],"cloud":[265],"computing,":[266],"logistics,":[267],"resource-constrained":[268],"machine":[269],"learning":[270],"deployment,":[271],"federated":[272],"learning,":[273],"design,":[276],"resources":[278],"must":[279],"allocated":[281],"diverse":[285],"structures":[287],"diminishing":[289],"returns.":[290]},"counts_by_year":[],"updated_date":"2026-03-20T20:47:17.329874","created_date":"2026-03-18T00:00:00"}