Dynamic Contracting Under Positive Commitment
Abstract
We consider a firm that sells products that arrive over time to a buyer. We study this problem under a notion we call positive commitment, where the seller is allowed to make binding positive promises to the buyer about items arriving in the future, but is not allowed to commit not to make further offers to the buyer in the future. We model this problem as a dynamic game where the seller chooses a mechanism at each period subject to a sequential rationality constraint, and characterize the perfect Bayesian equilibrium of this dynamic game. We prove the equilibrium is efficient and that the seller’s revenue is a function of the buyer’s ex ante utility under a no commitment model. In particular, all goods are sold in advance to the buyer at what we call the positive commitment price.
Cite
Text
Lobel and Leme. "Dynamic Contracting Under Positive Commitment." AAAI Conference on Artificial Intelligence, 2019. doi:10.1609/AAAI.V33I01.33012101Markdown
[Lobel and Leme. "Dynamic Contracting Under Positive Commitment." AAAI Conference on Artificial Intelligence, 2019.](https://mlanthology.org/aaai/2019/lobel2019aaai-dynamic/) doi:10.1609/AAAI.V33I01.33012101BibTeX
@inproceedings{lobel2019aaai-dynamic,
title = {{Dynamic Contracting Under Positive Commitment}},
author = {Lobel, Ilan and Leme, Renato Paes},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2019},
pages = {2101-2108},
doi = {10.1609/AAAI.V33I01.33012101},
url = {https://mlanthology.org/aaai/2019/lobel2019aaai-dynamic/}
}