A Mathematical Programming Approach to Optimal Design of Dutch Auctions

摘要

This paper is concerned with optimal design of Dutch auctions in which the bid levels are restricted to a finite set of values. We formulate this auctioning problem as a constrained nonlinear program and solve it with an aim to maximize the auctioneer's average revenue. Additionally, some important properties of the optimal bid levels as well as the maximum expected revenue are presented.