This paper proposes a nice electricity market design that is efficient and practical, meaningfully satisfying the wants of a market design's stakeholders. Hence, this new design should be considered by countries that have reformed their electricity sectors or are in the process of doing so

Dynamic mechanisms offer powerful techniques to improve on both revenue and efficiency by linking sequential auctions using state information, but these techniques rely on exact distributional information of the buyers' valuations (present and future), which limits their use in learning...

This paper considers dynamic communication mechanisms in a quasi-linear single-value environment. The mechanism designer gradually identifies agents' valuations by iteratively offering prices to agents at different stages. Agents pay the maximum price they accepted if their desirable decision is...

We develop a theory of long-run equilibrium in blockchain-based financial systems. Our theory elucidates the key market design features that separate proof of work and proof of stake approaches in the long run. Under proof of work, wasteful computation is used to secure the system, and users'...

A solution to marketplace information asymmetries is to have trading partners publicly rate each other post-transaction. Many have shown that these ratings are effective; we show that their effectiveness deteriorates over time. The problem is that ratings are prone to inflation, with raters...

Centralized school assignment algorithms must distinguish between applicants with the same preferences and priorities. This is done with randomly assigned lottery numbers, nonlottery tie-breakers like test scores, or both. The New York City public high school match illustrates the latter, using...

We design a non-clairvoyant dynamic mechanism under budget and ex-post individual rationality constraints that is dynamic incentive-compatible and achieves non-trivial revenue performance, even without any knowledge about the future. In particular, our dynamic mechanism obtains a constant...

Deferred Acceptance (DA), a widely implemented algorithm, is meant to improve allocations: under classical preferences, it induces preference-concordant rankings. However, recent evidence shows that—in both real, large-stakes applications and experiments—participants frequently play...

I study costly information acquisition in a two-sided matching problem, such as matching applicants to schools. Applicant's utility is a sum of common and idiosyncratic components. The idiosyncratic component is unknown to applicants but can be learned at a cost. When applicants are assigned...

Deferred Acceptance (DA), a widely implemented algorithm, is meant to improve allocations: under classical preferences, it induces preference-concordant rankings. However, recent evidence shows that—in both real, large-stakes applications and experiments—participants frequently play...