Earlier Version

On multiple keyword sponsored search auctions with budgets

Colini-Baldeschi R, Henzinger MH, Leonardi S, Starnberger M. 2012. On multiple keyword sponsored search auctions with budgets. 39th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 7392, 1–12.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published | English

Scopus indexed
Author
Colini-Baldeschi, Riccardo; Henzinger, MonikaISTA ; Leonardi, Stefano; Starnberger, Martin
Series Title
LNCS
Abstract
We study multiple keyword sponsored search auctions with budgets. Each keyword has multiple ad slots with a click-through rate. The bidders have additive valuations, which are linear in the click-through rates, and budgets, which are restricting their overall payments. Additionally, the number of slots per keyword assigned to a bidder is bounded. We show the following results: (1) We give the first mechanism for multiple keywords, where click-through rates differ among slots. Our mechanism is incentive compatible in expectation, individually rational in expectation, and Pareto optimal. (2) We study the combinatorial setting, where each bidder is only interested in a subset of the keywords. We give an incentive compatible, individually rational, Pareto optimal, and deterministic mechanism for identical click-through rates. (3) We give an impossibility result for incentive compatible, individually rational, Pareto optimal, and deterministic mechanisms for bidders with diminishing marginal valuations.
Publishing Year
Date Published
2012-07-01
Proceedings Title
39th International Colloquium on Automata, Languages, and Programming
Publisher
Springer Nature
Volume
7392
Page
1–12
Conference
ICALP: International Colloquium on Automata, Languages, and Programming
Conference Location
Warwick, United Kingdom
Conference Date
2012-07-09 – 2012-07-13
ISSN
IST-REx-ID

Cite this

Colini-Baldeschi R, Henzinger MH, Leonardi S, Starnberger M. On multiple keyword sponsored search auctions with budgets. In: 39th International Colloquium on Automata, Languages, and Programming. Vol 7392. Springer Nature; 2012:1–12. doi:10.1007/978-3-642-31585-5_1
Colini-Baldeschi, R., Henzinger, M. H., Leonardi, S., & Starnberger, M. (2012). On multiple keyword sponsored search auctions with budgets. In 39th International Colloquium on Automata, Languages, and Programming (Vol. 7392, pp. 1–12). Warwick, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-642-31585-5_1
Colini-Baldeschi, Riccardo, Monika H Henzinger, Stefano Leonardi, and Martin Starnberger. “On Multiple Keyword Sponsored Search Auctions with Budgets.” In 39th International Colloquium on Automata, Languages, and Programming, 7392:1–12. Springer Nature, 2012. https://doi.org/10.1007/978-3-642-31585-5_1.
R. Colini-Baldeschi, M. H. Henzinger, S. Leonardi, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” in 39th International Colloquium on Automata, Languages, and Programming, Warwick, United Kingdom, 2012, vol. 7392, pp. 1–12.
Colini-Baldeschi R, Henzinger MH, Leonardi S, Starnberger M. 2012. On multiple keyword sponsored search auctions with budgets. 39th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 7392, 1–12.
Colini-Baldeschi, Riccardo, et al. “On Multiple Keyword Sponsored Search Auctions with Budgets.” 39th International Colloquium on Automata, Languages, and Programming, vol. 7392, Springer Nature, 2012, pp. 1–12, doi:10.1007/978-3-642-31585-5_1.

Export

Marked Publications

Open Data ISTA Research Explorer

Search this title in

Google Scholar
ISBN Search