Optimal Dynamic Auctions
- Mallesh M. Pai | Northwestern University, Kellogg School of Management
We consider a dynamic auction problem motivated by the traditional single-leg, multi-period revenue management problem. A seller with Q units to sell, faces potential buyers who arrive and depart over the course of T time periods. The time at which a buyer arrives, the quantity she desires, the value she places on that quantity as well as the time by which she must make the purchase are private information. In this environment we derive the revenue maximizing Bayesian incentive compatible selling mechanism.
Joint with Rakesh Vohra
Speaker Details
Mallesh Pai is currently a graduate student at the Department of Managerial Economics and Decision Sciences, Kellogg School of Management, Northwestern University. Prior to this, he completed a Bachelor of Technology degree in Computer Science and Engineering from the Indian Institute of Technology Delhi.
-
-
Jeff Running
-
Watch Next
-
-
Fuzzy Extractors are Practical
- Melissa Chase,
- Amey Shukla
-
-
-
-
-
-
Accelerating MRI image reconstruction with Tyger
- Karen Easterbrook,
- Ilyana Rosenberg
-
From Microfarms to the Moon: A Teen Innovator’s Journey in Robotics
- Pranav Kumar Redlapalli
-