Second-price auctions with reserve play a critical role in the revenue of modern search engine and popular online sites since the revenue of these companies often directly depends on the outcome of such auctions. The choice of the reserve price is the main mechanism through which the auction revenue can be influenced in these electronic markets. We cast the problem of selecting the reserve price to optimize revenue as a learning problem and present a full theoretical analysis dealing with the complex properties of the corresponding loss function. We further give novel algorithms for solving this problem and report the results of several experiments demonstrating their effectiveness.
Mohri and Medina REF discuss selecting the reserve price to optimise revenue in a second price auction with reserve price.
Learning Theory and Algorithms for Revenue Optimization in Second-Price Auctions with Reserve
ArXiv
ArXiv
Computer Science Mathematics