To make high-quality research more accessible and easier to explore.

Fields:
4 results ✕ Clear filters

Robust Incentives for Teams

Econometrica 2022 90(4), 1583-1613
We show that demanding team incentives to be robust to nonquantifiable uncertainty about the game played by the agents leads to contracts that align the agents' interests. Such contracts have a natural interpretation as team‐based compensation. Under budget balance they reduce to linear contracts, thus identifying profit‐sharing, or equity, as an optimal contract absent a sink or a source of funds. A linear contract also gives the best profit guarantee to an outside residual claimant. These contracts still suffer from the free‐rider problem, but a positive guarantee obtains if and only if the technology known to the contract designer is sufficiently productive.

Value of Persistent Information

Econometrica 2017 85(6), 1921-1948 open access
We consider the value of persistent information in strictly competitive situations, formalized as stochastic zero-sum games where only the maximizer ob-serves the state that evolves according to an ergodic Markov operator. We say that operator Q is better for the maximizer than operator P if the value of the game under Q is higher than under P regardless of the stage game. We show that this defines a partial order on the space of ergodic Markov operators, and provide a full characterization of this partial order. An i.i.d. state is the best case for the informed player; however, a perfectly persistent state is not necessarily the worst case. The analysis relies on a novel characterization of the value of a stochastic game with incomplete information. Our results can alternatively be interpreted as pertaining to the limit of the minmax value in repeated Bayesian games with Markov types. 1.

Efficiency in Games With Markovian Private Information

Econometrica 2013 81(5), 1887-1934 open access
We study repeated Bayesian games with communication and observable actions in which the players' privately known payoffs evolve according to an irreducible Markov chain whose transitions are independent across players. Our main result implies that, generically, any Pareto-efficient payoff vector above a stationary minmax value can be approximated arbitrarily closely in a perfect Bayesian equilibrium as the discount factor goes to 1. As an intermediate step, we construct an approximately efficient dynamic mechanism for long finite horizons without assuming transferable utility.

Dynamic Mechanism Design: A Myersonian Approach

Econometrica 2014 82(2), 601-653 open access
The copyright to this Article is held by the Econometric Society. It may be downloaded, printed and reproduced only for educational or research purposes, including use in course packs. No downloading or copying may be done for any commercial purpose without the explicit permission of the Econometric Society. For such commercial purposes contact the Office of the Econometric Society (contact information may be found at the website