[FRIAM] gerrymandering algorithm question

[Marcus Daniels]

I would suggest formulating it as a quadratic unconstrained binary optimization problem and using a D-Wave quantum annealer to solve it!
You can get some free time here https://cloud.dwavesys.com.

From: Friam <friam-bounces at redfish.com> on behalf of cody dooderson <d00d3rs0n at gmail.com>
Reply-To: The Friday Morning Applied Complexity Coffee Group <friam at redfish.com>
Date: Friday, November 2, 2018 at 10:23 AM
To: The Friday Morning Applied Complexity Coffee Group <friam at redfish.com>
Subject: [FRIAM] gerrymandering algorithm question

The other day a puzzle about gerrymandering was shown to me. It is on the web at https://fivethirtyeight.com/features/rig-the-election-with-math/ . The 5x5 puzzle is doable by hand but the 14x10 seems too complex, and ripe for some computer assistance. What kind of algorithm would people use for it? Is there an optimal way to gerrymander the entire country?
In order to qualify this question as complex or philosophical enough for FRIAM, maybe i should  speculate about how I think that ranked choice voting would be better in terms of gerrymandering than what we currently use. My gut instinct is that ranked-choice would be less predictable and could possibly deter the gerrymanderers.


Cody Smith
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://redfish.com/pipermail/friam_redfish.com/attachments/20181102/0db16750/attachment.html>