Multi-Period Optimal Design of Online Auctions

In this paper, we first analyze the characteristics of online auction and propose a general analysis framework about the design of online auction. Based on the properties of online auction and a general analysis framework related to the design of online auction, then we discuss the multi-unit dynamic programming models of sequential online auction in order to maximize the seller´ expected profits whether the reserve price is private or public. It is shown that the seller with private reserve price can gain the bigger profits than the seller with public reserve price. Finally, numerical results for two cases are given, where we compute the maximal expected total revenue. We show that the numerical results are consistent with the theoretical analysis.