The Simplicity of Optimal Dynamic Mechanisms
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914973767172096 |
|---|---|
| author | Correa, Jose Cristi, Andres Koch, Laura Vargas |
| author_facet | Correa, Jose Cristi, Andres Koch, Laura Vargas |
| contents | A fundamental economic question is that of designing revenue-maximizing mechanisms in dynamic environments. This paper considers a simple yet compelling market model to tackle this question, where forward-looking buyers arrive at the market over discrete time periods, and a monopolistic seller is endowed with a limited supply of a single good. In the case of i.i.d. and regular valuations for the buyers, Board and Skrzypacz (2016) characterized the optimal mechanism and proved the optimality of posted prices in the continuous-time limit. Our main result considers the limit case of a continuum of buyers, establishing that for arbitrary independent buyers' valuations, posted prices and capacity rationing can implement the optimal anonymous mechanism. Our result departs from the literature in three ways: It does not make any regularity assumptions, it considers the case of general, not necessarily i.i.d., arrivals, and finally, not only posted prices but also capacity rationing takes part in the optimal mechanism. Additionally, if supply is unlimited, we show that the rationing effect vanishes, and the optimal mechanism can be implemented using posted prices only, à la Board (2008). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_11738 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Simplicity of Optimal Dynamic Mechanisms Correa, Jose Cristi, Andres Koch, Laura Vargas Theoretical Economics Computer Science and Game Theory 91B03, 91B26 A fundamental economic question is that of designing revenue-maximizing mechanisms in dynamic environments. This paper considers a simple yet compelling market model to tackle this question, where forward-looking buyers arrive at the market over discrete time periods, and a monopolistic seller is endowed with a limited supply of a single good. In the case of i.i.d. and regular valuations for the buyers, Board and Skrzypacz (2016) characterized the optimal mechanism and proved the optimality of posted prices in the continuous-time limit. Our main result considers the limit case of a continuum of buyers, establishing that for arbitrary independent buyers' valuations, posted prices and capacity rationing can implement the optimal anonymous mechanism. Our result departs from the literature in three ways: It does not make any regularity assumptions, it considers the case of general, not necessarily i.i.d., arrivals, and finally, not only posted prices but also capacity rationing takes part in the optimal mechanism. Additionally, if supply is unlimited, we show that the rationing effect vanishes, and the optimal mechanism can be implemented using posted prices only, à la Board (2008). |
| title | The Simplicity of Optimal Dynamic Mechanisms |
| topic | Theoretical Economics Computer Science and Game Theory 91B03, 91B26 |
| url | https://arxiv.org/abs/2410.11738 |