Behavioral Mechanism Design: Why "Winner-Take-All" Contests Win Over Fixed Pay

TL;DR

In the world of crowdsourcing, logic suggests that "safe" fixed payments should be the most efficient way to hire workers. However, this paper reveals a fascinating counter-intuitive truth: because humans are "irrationally" attracted to small chances of winning big (as modeled by Prospect Theory), principal-agent systems like Kaggle or Topcoder can actually outperform traditional fixed-wage models by using Winner-Take-All contests.

The "Rational" Flaw in Mechanism Design

Classic economic theory (Expected Utility Theory, or EUT) treats agents as calculators. If you want a job done, EUT suggests that workers prefer a certain $10overa1$1000 because of risk aversion. Under EUT, the optimal contract for any principal is simply a fixed payment.

However, the authors point out a critical disconnect: online labor markets (like Amazon Mechanical Turk or oDesk) involve individual humans, not cold-calculating firms. These individuals systematically deviate from EUT. They are loss-averse and, crucially, they overweight small probabilities.

The Behavioral Insight: Breaking the EUT Monopoly

The paper shifts the focus from effort (how hard someone works) to participation (whether they show up). In many online tasks, quality is largely intrinsic or monitored by software, making the primary challenge getting enough people in the door.

Methodology: EUT vs. Prospect Theory

The authors contrast two worlds:

1. The EUT World: Agents evaluate prospects via $\sum p_{k}u(x_k)$. Here, output-independent fixed payments are always the winner.
2. The Prospect Theory (PT) World: Agents evaluate via $\sum \pi (p_k)u(x_k)$. The weight function $\pi (p)$ is non-linear—it inflates the "perceived" importance of rare events.

Core Finding: When do Contests Dominate?

The pivotal contribution is the derivation of the "Contest Dominance" condition. A contest with a total prize $W$ dominates a fixed payment if: $\pi \left(\frac{c}{W}\right)>\frac{-u(-c)}{u(W)}$

This formula captures the battle between two human traits:

• The Pro-Contest Force: The overweighting of small probabilities ($\pi$).
• The Anti-Contest Force: Risk and loss aversion (the ratio of $u$ functions).

Quantitative Evidence

Using the iconic parameters from Tversky and Kahneman ($\alpha =0.88$, $\delta =0.65$), the authors prove that if the degree of probability distortion ($\delta$) is stronger than the degree of risk aversion ($\alpha$), a contest will eventually become more attractive than a fixed wage as the total prize $W$ grows.

Critical Analysis & Takeaways

• The Threshold Effect: Interestingly, the paper proves that if your budget is too small ($W\le c/p^{\ast }$), you should stick to fixed payments. Behavioral biases only "help" the principal when the prize is large enough to trigger the "dreaming of winning" effect.
• Architecture Matters: This explains why platforms like Kaggle successfully attract thousands of world-class data scientists for a single prize—the "perceived" utility of the prize, inflated by $\pi (p)$, exceeds the certain utility of a smaller wage.
• Limitation: The model assumes agents are homogeneous in cost. In reality, cost heterogeneity might dampen the contest's appeal if the most "efficient" workers are also the most risk-averse.

Conclusion

This work marks a significant step in Behavioral Mechanism Design. By acknowledging that humans "miscalculate" chances, designers can build systems that are not only more efficient for the principal but more engaging for the participants. For the future of AI-driven labor and decentralized finance (DeFi), understanding these "irrational" weights is no longer optional—it is the key to SOTA incentive design.