IDEAS home Printed from https://ideas.repec.org/p/cla/levrem/786969000000001080.html

Dynamic Revenue Maximization: A Continuous Time Approach

Author

Listed:
  • Dirk Bergemann
  • Philipp Strack

Abstract

We characterize the profit-maximizing mechanism for repeatedly selling a non-durable good in continuous time. The valuation of each agent is private information and changes over time. At the time of contracting every agent privately observes his initial type which influences the evolution of his valuation process. In the profit-maximizing mechanism the allocation is distorted in favor of agents with high initial types. We derive the optimal mechanism in closed form, which enables us to compare the distortion in various examples. The case where the valuation of the agents follows an arithmetic/geometric Brownian motion, Ornstein-Uhlenbeck process, or is derived from a Bayesian learning model are discussed. We show that depending on the nature of the private information and the valuation process the distortion might increase or decrease over time.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Dirk Bergemann & Philipp Strack, 2015. "Dynamic Revenue Maximization: A Continuous Time Approach," Levine's Bibliography 786969000000001080, UCLA Department of Economics.
    • Handle: RePEc:cla:levrem:786969000000001080
    as

    Download full text from publisher

    File URL: http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2610679
    Download Restriction: no
    ---><---

    Other versions of this item:

    More about this item

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cla:levrem:786969000000001080. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: David K. Levine (email available below). General contact details of provider: http://www.dklevine.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.