We provide a new characterization of implementability of reduced form mechanisms in terms of straightforward second-order stochastic dominance. In addition, we present a simple proof of Matthews’ (1984) conjecture, proved by Border (1991), on implementability.

More on this topic

BFI Working Paper·Jan 6, 2026

Biases in Belief Updating Within and Across Domains

Francesca Bastianello and Alex Imas
Topics: Uncategorized
BFI Working Paper·Oct 31, 2025

Simplicity and Portability in Mechanism Design: A Case for (and Against) the Worst Case

Benjamin Brooks and Songzi Du
Topics: Uncategorized
BFI Working Paper·Sep 18, 2025

The Impact of Language on Decision-Making: Auction Winners are Less Cursed in a Foreign Language

Fang Fu, Leigh H. Grant, Ali Hortaçsu, Boaz Keysar, Jidong Yang, and Karen J. Ye
Topics: Uncategorized