Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach

Alex Gershkov and Benny Moldovanu

American Economic Journal: Microeconomics, 2009, vol. 1, issue 2, pages 168-98

Abstract: We study the revenue-maximizing allocation of several heterogeneous, commonly ranked objects to impatient agents with privately known characteristics who arrive sequentially. There is a deadline after which no more objects can be allocated. We first characterize implementable allocation schemes, and compute the expected revenue for any implementable, deterministic and Markovian allocation policy. The revenue-maximizing policy is obtained by a variational argument which sheds more light on its properties than the usual dynamic programming approach. Finally, we use our main result in order to derive the optimal inventory choice, and explain empirical regularities about pricing in clearance sales. (JEL C61, D21, D82)

Date: 2009

Downloads: (external link)
http://hdl.handle.net/10.1257/mic.1.2.168 (text/html)
http://www.aeaweb.org/articles.php?doi=10.1257/mic.1.2.168 (application/pdf)
Access to full text is restricted to AEA members.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:aea:aejmic:v:1:y:2009:i:2:p:168-98

Ordering information: This journal article can be ordered from
http://www.aeaweb.org/subscribe.html

Access Statistics for this article

American Economic Journal: Microeconomics is edited by Andrew Postlewaite

More articles in American Economic Journal: Microeconomics from American Economic Association
Contact information at EDIRC.
Series data maintained by Christopher F. Baum ().