Individual and group fairness in geographical partitioning
Socioeconomic segregation often arises in school districting and other contexts, causing some groups to be over- or under-represented within a particular district. This phenomenon is closely linked with disparities in opportunities and outcomes. We formulate a new class of geographical partitioning problems in which the population is heterogeneous, and it is necessary to ensure fair representation for each group at each facility. We prove that the optimal solution is a novel generalization of the additively weighted Voronoi diagram, and we propose a simple and efficient algorithm to compute it, thus resolving an open question dating back to Dvoretzky et al. (1951). The efficacy and potential for practical insight of the approach are demonstrated in a realistic case study involving seven demographic groups and $78$ district offices.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering
Conventional fair graph clustering methods face two primary challenges: i) They prioritize balanced clusters at the expense of cluster cohesion by imposing rigid constraints, ii) Existing methods of both individual and g…
ClusteringFairnessGraph Clusteringgraph partitioningRecovering Fairness Directly from Modularity: a New Way for Fair Community Partitioning
Community partitioning is crucial in network analysis, with modularity optimization being the prevailing technique. However, traditional modularity-based methods often overlook fairness, a critical aspect in real-world a…
FairnessAssessing Predictive Models for Fairness Based on Movement Patterns
Assessing the spatial fairness of predictive models involves establishing whether they are statistically penalizing (favoring) individuals associated with certain geographical locations. Literature on this topic makes th…
Bridging the Fairness Divide: Achieving Group and Individual Fairness in Graph Neural Networks
Graph neural networks (GNNs) have emerged as a powerful tool for analyzing and learning from complex data structured as graphs, demonstrating remarkable effectiveness in various applications, such as social network analy…
Drug DiscoveryFairnessGraph LearningGraph Neural Network+1Spectral Normalized-Cut Graph Partitioning with Fairness Constraints
Normalized-cut graph partitioning aims to divide the set of nodes in a graph into $k$ disjoint clusters to minimize the fraction of the total edges between any cluster and all other clusters. In this paper, we consider a…
AttributeFairnessgraph partitioning