This setting lets you change the way you view articles. You can choose to have articles open in a dialog window, a new tab, or directly in the same window.
Open in Dialog
Open in New Tab
Open in same window
Open in New Tab
Open in same window

American Economic Journal: Microeconomics: Vol. 1 No. 2 (August 2009)
AEJ: Micro Volume. 1, Issue 2 |
Previous ArticleNext Article
Sign up for Email Alerts Follow us on Twitter Subscription Information
(Institutional Administrator Access)
AEJ: Micro Forthcoming Articles
Full-text Article
View Comments on This Article (0) | Login to post a comment
Previous ArticleNext Article
Expand
Quick Tools:
Print Article Summary Email Link to this Article Export CitationSign up for Email Alerts Follow us on Twitter Subscription Information
(Institutional Administrator Access)
Explore:
AEJ: Micro Forthcoming Articles
Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach
Article Citation
Gershkov, Alex, and
Benny Moldovanu. 2009. "Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach."
American Economic Journal: Microeconomics,
1(2): 168-98.
DOI: 10.1257/mic.1.2.168
DOI: 10.1257/mic.1.2.168
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)
Article Full-Text Access
Full-text Article
Authors
Gershkov, Alex (U Bonn)
Moldovanu, Benny (U Bonn)
Moldovanu, Benny (U Bonn)
JEL Classifications
C61: Optimization Techniques; Programming Models; Dynamic Analysis
D21: Firm Behavior
D82: Asymmetric and Private Information
D21: Firm Behavior
D82: Asymmetric and Private Information
Comments
View Comments on This Article (0) | Login to post a comment

