A Schelling point (or focal point) is the option that people tend to choose in a coordination problem when they cannot communicate, because it stands out as the answer each participant expects the others to expect. The idea is named after the game theorist Thomas Schelling, who observed that strangers asked to meet in a city without agreeing on a time or place often succeed anyway by converging on a salient landmark at a salient hour. Nothing enforces the choice; it works purely through mutual expectation.

Focal points matter to decentralized systems because permissionless networks routinely ask dispersed, non-communicating actors to converge on a single answer — a vote outcome, a protocol decision, or a reported data value. This article reviews the experimental evidence on when focal points work, how that logic was turned into an oracle design, and why its incentive assumptions have known limits.

Focal points in the laboratory

Experimental work shows that focal points are powerful but conditional. Crawford, Gneezy and Rottenstreich replicated Schelling's classic result under symmetric payoffs: in a "Chicago skyscrapers" matching game where both players stood to receive a hypothetical $100 for coordinating, 90 percent of subjects chose the salient landmark (the Sears Tower), for an expected coordination rate of 82 percent. Introducing a minute payoff asymmetry — $100 for one player versus $101 for the other — largely collapsed the focal point: only about 60 percent still chose the landmark, and expected coordination fell to 52 percent, barely above the roughly 50 percent achievable by a payoff-blind mixed strategy. A moderate asymmetry ($100 versus $110) eroded it further, to 48 percent choosing the landmark and roughly 50 percent coordination.

Paid experiments with abstract X and Y labels confirmed the pattern: symmetric labeled games reached 64 percent expected coordination, while a slightly asymmetric version ($5 versus $5.10) fell to 38 percent, performing essentially like games with no labels at all. Subjects did not "freely dispose" of the negligible difference in order to exploit the salient label; they attended to their own payoffs, destroying the shared focal point even though ignoring the one-dollar gap would have raised everyone's expected earnings. The authors account for the observed pattern of miscoordination with a nonequilibrium level-k model whose anchoring type is biased toward payoff-salient choices.

The picture is not uniformly bleak. Isoni, Poulsen, Sugden and Tsutsui studied tacit bargaining problems — coordination games with genuine conflict of interest and no communication — in which each player's strategies were framed as proposals over which valuable objects she would take. There, payoff-irrelevant spatial and relational cues acted as powerful focal points, reducing coordination failures even in games with no efficient and equal division, and systematically producing unequal payoff distributions that players accepted rather than miscoordinate. In bargaining-framed settings with strong cues, focal points can survive payoff conflict rather than collapsing under it — a partial counterweight to the Crawford, Gneezy and Rottenstreich findings.

SchellingCoin: coordination as an oracle

In 2014, Vitalik Buterin proposed SchellingCoin, a mechanism for bringing external data such as the ETH/USD price onto a blockchain without any trusted authority, by paying participants to converge on the same answer. The design rests on a game-theoretic wager: absent communication, "the truth is arguably the most powerful Schelling point out there," so honest reporting is the answer everyone expects everyone else to give. Participants first submit hashed values, then reveal them; the revealed values are sorted, submissions falling between the 25th and 75th percentile are rewarded, and the median becomes the consensus output. Buterin described the resulting equilibrium as an "infinitely recursive chain of logic" backed by nothing but mutual expectation — which is both its power and its fragility.

A companion post supplied a concrete smart-contract implementation: 100-block epochs split into a commit phase (blocks 0–49, submitting a hash of sender and value) and a reveal phase (blocks 50–99). The commit-reveal structure is what enforces the focal-point game — during commitment no participant can see anyone else's vote, so the rational uninformed strategy is to submit the true value everyone else is expected to submit. Buterin suggested the pattern generalizes beyond price feeds to any publicly verifiable data feed, with decentralization and participant diversity as the main safeguards.

Attack vectors and the limits of rationality

Buterin acknowledged several attack vectors from the outset. Any entity controlling more than roughly half of the submissions can unilaterally set the median, so the mechanism inherits a majority-collusion assumption. Participants with a financial stake in the reported value can engage in "micro-cheating," subtly skewing their answers, and even small coalitions offering side payments can create competing focal points. The implementation post added structural concerns: if a single exchange dominates trading, all votes cluster around its price, so the focal point silently becomes a single point of failure when that exchange is disrupted; gas costs at epoch boundaries make direct participation expensive for small players, pushing toward pooling and thus re-centralization; and downstream uses such as stable-value assets built on the feed remain exposed to strategic large trades that move the focal value itself.

Ford and Böhme generalized the critique. Permissionless systems, they argue, cannot bound the incentives participants face: out-of-band payments, bribery, and side bets — such as shorting a token while attacking it — can make protocol-deviant behavior the profit-maximizing choice while remaining invisible to in-protocol incentive analysis. They describe bribery and discouragement attacks in which an adversary makes honest participation economically unattractive, so that rational players exit or defect and incentive-based security arguments break down. Their conclusion is metacircular: assuming all participants are rational profit-maximizers creates exploitable blind spots, so that in open systems "it is rational to be irrational" — attackers who look irrational inside the model may be perfectly rational outside it. They recommend designing for resilience rather than incentive-compatibility alone: Byzantine fault tolerance against arbitrary behavior, behavioral realism, and social and institutional safeguards alongside technical ones. The point bears directly on Schelling-point mechanisms: an equilibrium sustained only by mutual expectation fails once a coalition can be paid to converge on a false focal point.

Relevance to Caper

Caper governance depends on the same coordination logic. Token holders decide proposals through on-chain voting, and any execution path that consumes externally reported data inherits focal-point dynamics. The experimental record cautions that convergence on the "obvious" outcome is reliable mainly when participants' payoffs are close to symmetric; holders who acquired their tokens at different prices, or who differ in stakes and information (see reputation and information asymmetry), face exactly the kind of payoff asymmetry that eroded coordination in the laboratory. Designing voting mechanisms that anticipate asymmetric incentives and out-of-band pressure is therefore a security consideration, not only a fairness one.

References

1. Vincent P. Crawford, Uri Gneezy, and Yuval Rottenstreich (2008). The Power of Focal Points Is Limited: Even Minute Payoff Asymmetry May Yield Large Coordination Failures. American Economic Review, 98(4): 1443–1458.
2. Andrea Isoni, Anders Poulsen, Robert Sugden, and Kei Tsutsui (2013). Focal points in tacit bargaining problems: Experimental evidence. European Economic Review, 59: 167–188.
3. Vitalik Buterin (2014). SchellingCoin: A Minimal-Trust Universal Data Feed. Ethereum Foundation Blog.
4. Vitalik Buterin (2014). Advanced Contract Programming Example: SchellingCoin. Ethereum Foundation Blog.
5. Bryan Ford and Rainer Böhme (2019). Rationality is Self-Defeating in Permissionless Systems. arXiv preprint arXiv:1910.08820.