Learning Theory and Algorithms for Revenue Optimization in Second Price Auctions with Reserve
Abstract
Second-price auctions with reserve play a critical role for 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 (it is non-convex and discontinuous). We further give novel algorithms for solving this problem and report the results of encouraging experiments demonstrating their effectiveness.
Cite
Text
Mohri and Medina. "Learning Theory and Algorithms for Revenue Optimization in Second Price Auctions with Reserve." International Conference on Machine Learning, 2014.Markdown
[Mohri and Medina. "Learning Theory and Algorithms for Revenue Optimization in Second Price Auctions with Reserve." International Conference on Machine Learning, 2014.](https://mlanthology.org/icml/2014/mohri2014icml-learning/)BibTeX
@inproceedings{mohri2014icml-learning,
title = {{Learning Theory and Algorithms for Revenue Optimization in Second Price Auctions with Reserve}},
author = {Mohri, Mehryar and Medina, Andres Munoz},
booktitle = {International Conference on Machine Learning},
year = {2014},
pages = {262-270},
volume = {32},
url = {https://mlanthology.org/icml/2014/mohri2014icml-learning/}
}