Keyword auction protocol for dynamically adjusting the number of advertisements

Yuko Sakurai, Atsushi Iwasaki, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Search engines including Yahoo! and Google utilize a keyword auction for ranking the advertisements displayed around the search results. In existing keyword auctions called the GSP, the number of displayed advertisements (slots) is determined in advance. Therefore, we consider adjusting the number of advertisements dynamically based on bids in order to improve both social surplus and seller's revenue. For example, we allow a bidder to display her advertisement exclusively when she is willing to pay a premium. We propose a new keyword auction protocol called the GSP-ExR in which the number of slots can be either 1 or K. The GSP-ExR pricing scheme is relatively simple and the seller's revenue is at least as good as with the GSP. If the highest ranked bidder's bid is large enough, she can exclusively display her advertisement by paying a premium. Otherwise, the GSP-ExR is identical to the GSP.

Original languageEnglish
Title of host publicationProceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008
Pages410-416
Number of pages7
DOIs
Publication statusPublished - 2008
Event2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008 - Sydney, NSW, Australia
Duration: Dec 9 2008Dec 12 2008

Other

Other2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008
CountryAustralia
CitySydney, NSW
Period12/9/0812/12/08

Fingerprint

Network protocols
Search engines
Costs

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Software

Cite this

Sakurai, Y., Iwasaki, A., & Yokoo, M. (2008). Keyword auction protocol for dynamically adjusting the number of advertisements. In Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008 (pp. 410-416). [4740658] https://doi.org/10.1109/WIIAT.2008.218

Keyword auction protocol for dynamically adjusting the number of advertisements. / Sakurai, Yuko; Iwasaki, Atsushi; Yokoo, Makoto.

Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008. 2008. p. 410-416 4740658.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sakurai, Y, Iwasaki, A & Yokoo, M 2008, Keyword auction protocol for dynamically adjusting the number of advertisements. in Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008., 4740658, pp. 410-416, 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008, Sydney, NSW, Australia, 12/9/08. https://doi.org/10.1109/WIIAT.2008.218
Sakurai Y, Iwasaki A, Yokoo M. Keyword auction protocol for dynamically adjusting the number of advertisements. In Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008. 2008. p. 410-416. 4740658 https://doi.org/10.1109/WIIAT.2008.218
Sakurai, Yuko ; Iwasaki, Atsushi ; Yokoo, Makoto. / Keyword auction protocol for dynamically adjusting the number of advertisements. Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008. 2008. pp. 410-416
@inproceedings{c1ea03eb1fcb4ddab01031d181066e85,
title = "Keyword auction protocol for dynamically adjusting the number of advertisements",
abstract = "Search engines including Yahoo! and Google utilize a keyword auction for ranking the advertisements displayed around the search results. In existing keyword auctions called the GSP, the number of displayed advertisements (slots) is determined in advance. Therefore, we consider adjusting the number of advertisements dynamically based on bids in order to improve both social surplus and seller's revenue. For example, we allow a bidder to display her advertisement exclusively when she is willing to pay a premium. We propose a new keyword auction protocol called the GSP-ExR in which the number of slots can be either 1 or K. The GSP-ExR pricing scheme is relatively simple and the seller's revenue is at least as good as with the GSP. If the highest ranked bidder's bid is large enough, she can exclusively display her advertisement by paying a premium. Otherwise, the GSP-ExR is identical to the GSP.",
author = "Yuko Sakurai and Atsushi Iwasaki and Makoto Yokoo",
year = "2008",
doi = "10.1109/WIIAT.2008.218",
language = "English",
isbn = "9780769534961",
pages = "410--416",
booktitle = "Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008",

}

TY - GEN

T1 - Keyword auction protocol for dynamically adjusting the number of advertisements

AU - Sakurai, Yuko

AU - Iwasaki, Atsushi

AU - Yokoo, Makoto

PY - 2008

Y1 - 2008

N2 - Search engines including Yahoo! and Google utilize a keyword auction for ranking the advertisements displayed around the search results. In existing keyword auctions called the GSP, the number of displayed advertisements (slots) is determined in advance. Therefore, we consider adjusting the number of advertisements dynamically based on bids in order to improve both social surplus and seller's revenue. For example, we allow a bidder to display her advertisement exclusively when she is willing to pay a premium. We propose a new keyword auction protocol called the GSP-ExR in which the number of slots can be either 1 or K. The GSP-ExR pricing scheme is relatively simple and the seller's revenue is at least as good as with the GSP. If the highest ranked bidder's bid is large enough, she can exclusively display her advertisement by paying a premium. Otherwise, the GSP-ExR is identical to the GSP.

AB - Search engines including Yahoo! and Google utilize a keyword auction for ranking the advertisements displayed around the search results. In existing keyword auctions called the GSP, the number of displayed advertisements (slots) is determined in advance. Therefore, we consider adjusting the number of advertisements dynamically based on bids in order to improve both social surplus and seller's revenue. For example, we allow a bidder to display her advertisement exclusively when she is willing to pay a premium. We propose a new keyword auction protocol called the GSP-ExR in which the number of slots can be either 1 or K. The GSP-ExR pricing scheme is relatively simple and the seller's revenue is at least as good as with the GSP. If the highest ranked bidder's bid is large enough, she can exclusively display her advertisement by paying a premium. Otherwise, the GSP-ExR is identical to the GSP.

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

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

U2 - 10.1109/WIIAT.2008.218

DO - 10.1109/WIIAT.2008.218

M3 - Conference contribution

AN - SCOPUS:62949220229

SN - 9780769534961

SP - 410

EP - 416

BT - Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008

ER -