<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A partisan districting protocol with provably nonpartisan outcomes · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1710.08781/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1710.08781/feed.xml" rel="self" type="application/rss+xml" /><item><title>A partisan districting protocol with provably nonpartisan outcomes — mentioned by WalterBright</title><link>https://news.ycombinator.com/item?id=48589366</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.08781:48589366</guid><pubDate>Thu, 18 Jun 2026 18:20:50 GMT</pubDate><description>&lt;p&gt;Some mathematicians worked out a way to fairly do districting, similar to having one kid cut the cake and the other kid gets first choice: &amp;quot;A partisan districting protocol with provably nonpartisan outcomes&amp;quot; by Wesley Pegden, Ariel D. Procaccia, Dingli Yu https://arxiv.org/abs/1710.08781&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.08781/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item><item><title>A partisan districting protocol with provably nonpartisan outcomes — mentioned by WalterBright</title><link>https://news.ycombinator.com/item?id=39229975</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.08781:39229975</guid><pubDate>Fri, 02 Feb 2024 15:52:09 GMT</pubDate><description>&lt;p&gt;This problem has been solved by mathematicians: A partisan districting protocol with provably nonpartisan outcomes https://arxiv.org/abs/1710.08781 by Wesley Pegden, Ariel D. Procaccia, Dingli Yu&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.08781/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item><item><title>A partisan districting protocol with provably nonpartisan outcomes — mentioned by MengerSponge</title><link>https://news.ycombinator.com/item?id=36241252</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.08781:36241252</guid><pubDate>Thu, 08 Jun 2023 13:08:33 GMT</pubDate><description>&lt;p&gt;Yes, and it works really well for two parties if both parties are equally informed and competent. https://arxiv.org/abs/1710.08781 For n&amp;gt;2 the simple I-cut-you-choose stops working.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.08781/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item><item><title>A partisan districting protocol with provably nonpartisan outcomes — mentioned by wnoise</title><link>https://news.ycombinator.com/item?id=33516163</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.08781:33516163</guid><pubDate>Tue, 08 Nov 2022 05:30:09 GMT</pubDate><description>&lt;p&gt;&amp;quot;A Partisan Districting Protocol with Provably Nonpartisan Outcomes&amp;quot; https://arxiv.org/abs/1710.08781 Very cool. Though it does freeze in the two-party nature.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.08781/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item><item><title>A partisan districting protocol with provably nonpartisan outcomes — mentioned by MengerSponge</title><link>https://news.ycombinator.com/item?id=25877301</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.08781:25877301</guid><pubDate>Fri, 22 Jan 2021 22:52:54 GMT</pubDate><description>&lt;p&gt;Any attempt to completely automate this process is destined to fail, for all the reasons given in this thread. Weighting factors matter, and it is naive to assume that nobody is going to attempt to subvert a nonpartisan board, when so much power is at stake. Don&amp;#x27;t despair! There&amp;#x27;s an alternative that generates an equitable outcome between two parties that are trying to screw their rivals: Cake Cutting. https://arxiv.org/abs/1710.08781v1 You&amp;#x27;ve probably heard the basic version of how to fairly divide a piece of cake between two children. Have one of them cut it, then the other choose which…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.08781/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item><item><title>A partisan districting protocol with provably nonpartisan outcomes — HN submission</title><link>https://news.ycombinator.com/item?id=15665643</link><guid isPermaLink="false">urn:hackerpapers:submission:1710.08781:15665643</guid><pubDate>Thu, 09 Nov 2017 20:32:37 GMT</pubDate><description>&lt;p&gt;A partisan districting protocol with provably nonpartisan outcomes&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1710.08781/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item></channel></rss>
