Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach
Alex Gershkov and
Benny Moldovanu ()
American Economic Journal: Microeconomics, 2009, vol. 1, issue 2, 168-98
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)
JEL-codes: C61 D21 D82 (search for similar items in EconPapers)
Note: DOI: 10.1257/mic.1.2.168
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (34) Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to AEA members and institutional subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:aea:aejmic:v:1:y:2009:i:2:p:168-98
Ordering information: This journal article can be ordered from
Access Statistics for this article
American Economic Journal: Microeconomics is currently edited by Johannes Hörner
More articles in American Economic Journal: Microeconomics from American Economic Association Contact information at EDIRC.
Bibliographic data for series maintained by Michael P. Albert ().