Regret minimization for reserve prices in second-price auctions

Nicolò Cesa-Bianchi; Claudio Gentile; Yishay Mansour

doi:10.1137/1.9781611973105.86

Regret minimization for reserve prices in second-price auctions

Nicolò Cesa-Bianchi^*, Claudio Gentile, Yishay Mansour

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

42 Scopus citations

Abstract

We show a regret minimization algorithm for setting the reserve price in second-price auctions. We make the assumption that all bidders draw their bids from the same unknown and arbitrary distribution. Our algorithm is computationally efficient, and achieves a regret of Õ(√T), even when the number of bidders is stochastic with a known distribution.

Original language	English
Title of host publication	Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013
Publisher	Association for Computing Machinery
Pages	1190-1204
Number of pages	15
ISBN (Print)	9781611972511
DOIs	https://doi.org/10.1137/1.9781611973105.86
State	Published - 2013
Event	24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 - New Orleans, LA, United States Duration: 6 Jan 2013 → 8 Jan 2013

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference	24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013
Country/Territory	United States
City	New Orleans, LA
Period	6/01/13 → 8/01/13

Access to Document

10.1137/1.9781611973105.86

Cite this

Cesa-Bianchi, N., Gentile, C., & Mansour, Y. (2013). Regret minimization for reserve prices in second-price auctions. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 (pp. 1190-1204). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms). Association for Computing Machinery. https://doi.org/10.1137/1.9781611973105.86

@inproceedings{bc60c57f4e1145eaaa088797d94df557,

title = "Regret minimization for reserve prices in second-price auctions",

abstract = "We show a regret minimization algorithm for setting the reserve price in second-price auctions. We make the assumption that all bidders draw their bids from the same unknown and arbitrary distribution. Our algorithm is computationally efficient, and achieves a regret of {\~O}(√T), even when the number of bidders is stochastic with a known distribution.",

author = "Nicol{\`o} Cesa-Bianchi and Claudio Gentile and Yishay Mansour",

year = "2013",

doi = "10.1137/1.9781611973105.86",

language = "אנגלית",

isbn = "9781611972511",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "1190--1204",

booktitle = "Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013",

note = "24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 ; Conference date: 06-01-2013 Through 08-01-2013",

}

Cesa-Bianchi, N, Gentile, C & Mansour, Y 2013, Regret minimization for reserve prices in second-price auctions. in Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery, pp. 1190-1204, 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, LA, United States, 6/01/13. https://doi.org/10.1137/1.9781611973105.86

Regret minimization for reserve prices in second-price auctions. / Cesa-Bianchi, Nicolò; Gentile, Claudio; Mansour, Yishay.
Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. Association for Computing Machinery, 2013. p. 1190-1204 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Regret minimization for reserve prices in second-price auctions

AU - Cesa-Bianchi, Nicolò

AU - Gentile, Claudio

AU - Mansour, Yishay

PY - 2013

Y1 - 2013

N2 - We show a regret minimization algorithm for setting the reserve price in second-price auctions. We make the assumption that all bidders draw their bids from the same unknown and arbitrary distribution. Our algorithm is computationally efficient, and achieves a regret of Õ(√T), even when the number of bidders is stochastic with a known distribution.

AB - We show a regret minimization algorithm for setting the reserve price in second-price auctions. We make the assumption that all bidders draw their bids from the same unknown and arbitrary distribution. Our algorithm is computationally efficient, and achieves a regret of Õ(√T), even when the number of bidders is stochastic with a known distribution.

UR - http://www.scopus.com/inward/record.url?scp=84876049382&partnerID=8YFLogxK

U2 - 10.1137/1.9781611973105.86

DO - 10.1137/1.9781611973105.86

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84876049382

SN - 9781611972511

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 1190

EP - 1204

BT - Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013

PB - Association for Computing Machinery

T2 - 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013

Y2 - 6 January 2013 through 8 January 2013

ER -

Regret minimization for reserve prices in second-price auctions

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this