This paper experimentally studies an essential institutional feature of matching markets: Randomization of allocation priorities. I compare single and multiple randomization in the student assignment problem with ties. The Gale-Shapley deferred acceptance algorithm is employed after...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

We explain how the common practice of size-discovery trade detracts from overallfinancial market efficiency. At each of a series of size-discovery sessions, traders report theirdesired trades, generating allocations of the asset and cash that rely on the most recent exchangeprice. Traders can...

We consider the problem faced by a procurement agency that runs a mechanism for constructing an assortment of differentiated products with posted prices, from which heterogeneous consumers buy their most preferred alternative. Procurement mechanisms used by large organizations, including...

We study a dynamic matching environment where individuals arrive sequentially. There is a tradeoff between waiting for a thicker market, allowing for higher-quality matches, and minimizing agents' waiting costs. The optimal mechanism cumulates a stock of incongruent pairs up to a threshold and...

This paper compares two prominent stochastic assignment mechanisms in the laboratory: Random serial dictatorship (RSD) and top trading cycles with random endowments (TTC). In standard theory, both mechanisms are strategy-proof and Pareto-effcient for the house allocation problem without...