Fair division and redistricting

MaRDI QIDQ2939693zbMATH OpenFDO

Authors Zeph A. Landau, Francis Edward Su

Publication date 22 January 2015

Full work available at URL https://arxiv.org/abs/1402.0862

Mathematics Subject Classification ID

History, political science (91F10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Voting theory (91B12)

Abstract: Recently, Landau, Reid and Yershov provided a novel solution to the problem of redistricting. Instead of trying to ensure fairness by restricting the shape of the possible maps or by assigning the power to draw the map to nonbiased entities, the solution ensures fairness by balancing competing interests against each other. This kind of solution is an example of what are known as "fair division" solutions--- such solutions involve the preferences of all parties and are accompanied by rigorous guarantees of a specified well-defined notion of fairness. In this expository article, we give an introduction to the ideas of fair division in the context of this redistricting solution. Through examples and discussion we clarify how fair division methods can play an important role in a realistic redistricting solution by introducing an interactive step that incorporates a certain kind of fairness that can be used in concert with, and not a substitute for, other necessary or desired criteria for a good redistricting solution.

Recommendations

• A fair division solution to the problem of redistricting
• Fair redistricting is hard
• A computational approach to unbiased districting
• Axiomatic districting
• scientific article; zbMATH DE number 1015852

Cited in

(2)

• A fair division solution to the problem of redistricting
• Fair redistricting is hard

This page was built for publication: Fair division and redistricting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2939693)