TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Topological Problems in Voting

95 pointsby rtolsma11 months ago

5 comments

lukifer11 months ago
Arrow’s Theorem is often invoked as a criticism of alternative voting systems (RCV, etc). And not while not wrong exactly, it seems textbook “perfect being the enemy of the good”. (It’s also one reason I prefer Approval Voting, which in addition to its benefit of simplicity, sidesteps Arrow by redefining the goal: not perfectly capturing preferences, but maximizing Consent of the Governed.)
评论 #40694438 未加载
评论 #40694644 未加载
评论 #40694014 未加载
johnkpaul11 months ago
Hmm, is this author related to the Physics for the Birds YouTube channel?<p>That channel just released a video on the same topic.<p><a href="https:&#x2F;&#x2F;youtu.be&#x2F;v5ev-RAg7Xs?si=X1LY6Qc_s-HDqI3S" rel="nofollow">https:&#x2F;&#x2F;youtu.be&#x2F;v5ev-RAg7Xs?si=X1LY6Qc_s-HDqI3S</a>
评论 #40694164 未加载
评论 #40694087 未加载
contravariant11 months ago
I&#x27;m not quite sure why one would use a sphere, unless you were specifically trying to get a version of Arrow&#x27;s theorem.<p>If anything it looks like it fails <i>precisely</i> because the space is not homologically trivial, but I&#x27;m a bit unsure how to make that precise. A similar set up with just [0,1]^n as preference space works perfectly fine just by averaging all the scores for each candidate.<p>I kind of sense that requiring a function X^k -&gt; X to exist is somehow hard if X is not &#x27;simple&#x27;, but I&#x27;m not yet sure what the obstruction is.
评论 #40693357 未加载
评论 #40694225 未加载
评论 #40694591 未加载
unfamiliar11 months ago
Am I missing something or does the article fail to explain the point of Arrow’s Theorem? Is it satisfied for the discrete case, provably impossible, or what?<p>&gt; While this applies to discrete rankings and voter preferences, one might wonder if it’s a unique property of its discrete nature in how candidates are only ranked by ordering. Unfortunately, a similarly flavored result holds even in the continuous setting! It seems there’s no getting around the fact that voting is pretty hard to get right.<p>I don’t follow any of this paragraph.
评论 #40692644 未加载
评论 #40694955 未加载
cfgauss271811 months ago
On a glance, the Chichilinsky theorem assumption of smoothness for the mapping between voter preferences And the vote result (the relation phi) seems burdensome. For example, many people might be effectively summarized as single issue voters - the topological consequences of a typical definition of differentiation (calculus) would seem unjustified. The exercise of exploring this world may be interesting, but I’m not convinced of its utility to politics.