<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
    <channel>
        <title>The Wisdom of Wise Crowds</title>
        <link>https://paragraph.com/@kylewaters</link>
        <description>exploring data markets, wisdom of the crowds, schelling point games, incentive mechanisms to surface intelligence</description>
        <lastBuildDate>Sat, 04 Apr 2026 07:53:20 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>https://github.com/jpmonette/feed</generator>
        <language>en</language>
        <image>
            <title>The Wisdom of Wise Crowds</title>
            <url>https://storage.googleapis.com/papyrus_images/78606b2e0100f6e376ed5fc9f5fb9ac9.png</url>
            <link>https://paragraph.com/@kylewaters</link>
        </image>
        <copyright>All rights reserved</copyright>
        <item>
            <title><![CDATA[The Surprisingly Popular Algorithm, Simulated]]></title>
            <link>https://paragraph.com/@kylewaters/the-surprisingly-popular-algorithm</link>
            <guid>YsqJXZwZFq6Rw6kfNC8s</guid>
            <pubDate>Wed, 29 Jan 2025 16:27:15 GMT</pubDate>
            <description><![CDATA[The concept of crowd wisdom had a moment in the spotlight in 2024. With the popularization of prediction markets like Polymarket, there's a heightened realization in the power of markets to aggregate information. As amazing as markets are in aggregating information from disparate sources, are there ways in which we can better identify expert opinions among the crowd? The surprisingly popular algorithm is an intriguing attempt at just that.]]></description>
            <content:encoded><![CDATA[<p>The concept of crowd wisdom had a moment in the spotlight in 2024. With the popularization of prediction markets like Polymarket, there's a heightened realization in the <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://vitalik.eth.limo/general/2024/11/09/infofinance.html">power of markets</a> to aggregate information.</p><p>As amazing as markets are in aggregating information from disparate sources, are there ways in which we can better identify expert opinions among the crowd? The surprisingly popular algorithm is an intriguing attempt at just that.</p><div class="relative header-and-anchor"><h3 id="h-what-is-the-surprisingly-popular-algorithm">What is the "Surprisingly Popular" Algorithm?</h3></div><p>The Surprisingly Popular Algorithm (SPA) comes from the 2017 <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.nature.com/articles/nature21054"><u>paper</u></a> published in <em>Nature </em>titled "A Solution to the single-question crowd wisdom problem" by Drazen Prelec, H. Sebastian Seung, and John McCoy.</p><p>SPA is a novel method to extract the truth from a crowd even when the majority opinion is wrong. The key insight comes from the fact that the expert often possesses an additional signal beyond just the right answer: they will know not just the correct answer but <strong>also</strong> what the layperson will believe. In the author's own words: "the genius is you let a more knowledgeable minority reveal itself through predictions that the majority of people will disagree with them."</p><p>The paper showcases SPA's performance across diverse domains and a range of question types. But the easiest way to grok the SPA is to consider the world of a Yes/No question. The leading example in the paper is the following question: "Is Philadelphia the capital of Pennsylvania?" It is a question that more often than not, people will get wrong. They incorrectly believe Philly is the capital (it is Harrisburg). In other words, a democratic vote will most likely yield the wrong answer of "Yes". But, by applying the SPA, we can expect to get the right answer of "No" under certain conditions.</p><p>Below, I've simulated the SPA for this verifiable binary question (Y/N) under certain assumptions of the probability distributions of respondents' beliefs. We will see when SPA works, and when it can break down.</p><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.kylejwaters.com/writings/spa_simulation.html#Define-the-SPA-Algorithm">https://www.kylejwaters.com/writings/spa_simulation.html#Define-the-SPA-Algorithm</a></p><p></p>]]></content:encoded>
            <author>kylewaters@newsletter.paragraph.com (Kyle Waters)</author>
            <enclosure url="https://storage.googleapis.com/papyrus_images/041daf0f30797f968ab307a68c861503.jpg" length="0" type="image/jpg"/>
        </item>
    </channel>
</rss>