You are here


Auctions and simulation-based optimization in revenue management

Gustavo Jose Vulcano, 2003
Faculty Advisor: Garrett J. van Ryzin


In this dissertation, we study two auction-related problems and one network capacity control problem; all of them belonging to the broad field of Revenue Management.

The auction setting for the first two problems is the same, following the traditional private values model, but embedded in a dynamic framework: The seller conducts a sequence of auctions. Within each period, a random number of potential buyers (bidders) participate in the auction. Each bidder has his own valuation, but from the seller's perspective and from other bidders' perspective, valuations follow some common knowledge distribution. The sets of bidders are independent from one period to the other.

In the first essay, a seller with C units to sell faces a sequence of buyers separated into T time periods. The problem is to find the revenue-maximizing auction. Buyers compete directly against each other within a period, as in a traditional auction, and indirectly with buyers in other periods through the opportunity cost of capacity assessed by the seller, providing a variation of the traditional single-leg, multi-period revenue management problem over a finite time horizon. For this setting, we prove that dynamic variants of the first-price and second-price auction mechanisms maximize the seller's expected revenue. We also show explicitly how to compute and implement these optimal auctions. The optimal auctions are then compared to a traditional revenue management mechanism-in which list prices are used in each period together with capacity controls-and to a simple auction heuristic that consists of allocating units to each period and running a sequence of standard, multi-unit auctions with fixed reserve prices.

The second essay is an extension of the first essay to a joint inventory-pricing system over an infinite horizon. The firm must decide how to conduct its auctions and how to replenish its stock over time to maximize its profits. We show that the optimal auction and replenishment policy for this problem is quite simple, consisting of running a standard first-price or second-price auction with a fixed reserve price in each period and using an order-up-to (basestock) policy for replenishing inventory. We also present some numerical comparisons with list pricing.

Finally, in the third essay we consider the problem of jointly managing the capacities of a network of resources through virtual nesting. In virtual nesting, itinerary-fare-class combinations are mapped (indexed) into a small number of virtual classes on each leg of the network. Leg protection levels are then applied to these virtual classes in order to control itinerary availability. We formulate a continuous demand and capacity model for this discrete problem, allowing the partial acceptance of requests. Since our model is continuous, we are able to compute subgradients exactly using a simple and efficient recursion, and then embed them within a stochastic quasigradient algorithm, leading to a locally convergent procedure. Moreover, in several test problems on realistic networks, the method produces significant performance improvements relative to the protection levels produced by heuristic virtual nesting schemes. These results suggest the method has good practical potential as well.

Application Deadlines

Master of Science in Marketing >

For Fall 2016 Entry:

Available: August 1st, 2015
Deadline: January 4th, 2016


Master of Science in Financial Economics >

For Fall 2016 Entry:

Available: August 1st, 2015
Deadline: January 4th, 2016


Master of Science in Management Science and Engineering >

For Fall 2016 Entry:
To be determined


Available 8/1/15
Sept 2016

Deadline: 01/05/16

MS Marketing
Deadline: 01/04/16

MS Financial Economics
Deadline: 01/04/16


Doctoral Program News

Young Alumni Balseiro wins George B. Dantzig Dissertation Award

At the 2014 Informs national meeting, Santiago Balseiro was honored for his work in "Competition and Yield Optimization in Ad Exchanges". We congratulate Santiago on his accomplishment.

Read More Here

Ethan Rouen wins Deloitte Doctoral Fellowship in Accounting

The Deloitte Foundation has awarded $25,000 grants to 10 top accounting Ph.D. candidates through the Deloitte Foundation’s annual Doctoral Fellowship program. Given to students who plan to pursue academic careers upon graduation, the award will support the 2015 recipients’ final year of coursework and the subsequent year to complete their doctoral dissertation.

Read More Here

Honigsberg featured in Ideas at Work

The August issue of Ideas at Work features research that doctoral candidate Colleen Honigsberg led in conjunction with Sharon Katz.

Read More about Colleen

Wazlawek featured in Ideas at Work

Abbie Wazlawek's joint research with Professor Daniel Ames is featured in the June 24th, 2014 edition of Ideas at Work

Read More about Abbie

Ethan Rouen featured in Ideas at Work

Ethan Rouen's joint research with Professor Dan Amiram is featured in the May 15th, 2014 edition of Ideas at Work

Read More about Abbie

Rivas Wins Fellowship

The PhD program is proud to congratulate Miguel Duro Rivas, who was awarded the Nasdaq Educational Foundation Doctoral Dissertation Fellowship.

Read More about Miguel

Wong wins Deloitte Fellowship

We are proud to announce that Yu Ting (Forester) Wong is one of the recipients of the 2014 Deloitte Foundation Doctoral Fellowship in Accounting.

Read More About Yu Ting >

The PhD Program Congratulates John Yao

PhD student John Yao was a finalist in the 2013 M&SOM (Manufacturing & Service Operations Management) student paper competition.

Read More About John >

Honigsberg Named Postdoctoral Fellow

The PhD program is proud to congratulate Colleen Honigsberg, who was named the Postdoctoral Fellow in Corporate Governance at the Millstein Center at Columbia Law School in October 2013

Read More about Colleen >


Check Application Status

Students listening to classroom lecture

Once you've submitted your application, you can login and track your status by using the link below.

Check Status