Defining Equitable Geographic Districts in Road Networks via Stable Matching

Understand

We introduce a novel method for defining geographic districts in road networks using stable matching.

• In this approach, each geographic district is defined in terms of a center, which identifies a location of interest, such as a post office or polling place, and all other network vertices must be labeled with the center to which they are associated.
• We focus on defining geographic districts that are equitable, in that every district has the same number of vertices and the assignment is stable in terms of geographic distance.
• That is, there is no unassigned vertex-center pair such that both would prefer each other over their current assignments.