The University of Southampton
University of Southampton Institutional Repository

Dynamic revenue maximization with heterogeneous objects: a mechanism design approach

Dynamic revenue maximization with heterogeneous objects: a mechanism design approach
Dynamic revenue maximization with heterogeneous objects: a mechanism design approach
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)
1945-7669
168-198
Gershkov, Alex
214a0b5e-c742-486d-b910-c8ec702c943a
Moldovanu, Benny
f84fdd42-3143-4219-be24-fb26385b106d
Gershkov, Alex
214a0b5e-c742-486d-b910-c8ec702c943a
Moldovanu, Benny
f84fdd42-3143-4219-be24-fb26385b106d

Gershkov, Alex and Moldovanu, Benny (2009) Dynamic revenue maximization with heterogeneous objects: a mechanism design approach. American Economic Journal: Microeconomics, 1 (2), 168-198. (doi:10.1257/mic.1.2.168).

Record type: Article

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)

This record has no associated files available for download.

More information

e-pub ahead of print date: 2 August 2009

Identifiers

Local EPrints ID: 503664
URI: http://eprints.soton.ac.uk/id/eprint/503664
ISSN: 1945-7669
PURE UUID: e4f88b9f-1f88-4118-8c37-b44414b4ed5e
ORCID for Alex Gershkov: ORCID iD orcid.org/0000-0002-6062-8428

Catalogue record

Date deposited: 08 Aug 2025 16:36
Last modified: 09 Aug 2025 02:19

Export record

Altmetrics

Contributors

Author: Alex Gershkov ORCID iD
Author: Benny Moldovanu

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×