Skip to main content
Erschienen in: The Journal of Supercomputing 3/2014

01.09.2014

Correcting vindictive bidding behaviors in sponsored search auctions

verfasst von: Chen-Kun Tsung, Hann-Jang Ho, Sing-Ling Lee

Erschienen in: The Journal of Supercomputing | Ausgabe 3/2014

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this study, we aim to develop a pricing mechanism that reduces the effects resulted by vindictive advertisers who bid on sponsored search auctions run by search engine providers. In particular, we aim to ensure payment fairness and price stability in these auctions. With the generalized second price principle, advertisers pay the next-ranked bid value rather than the price that they bid. Vindictive bidders take advantage of this principle to manipulate the payment of a previously-ranked advertiser. Vindictive bidding results in unfair outcomes and eliminates equilibria. However, it is difficult to compute rational payments for all advertisers as advertisers’ valuations are private. Our proposed mechanism decreases the payment to make up for the utility loss that is induced by vindictive bidding. The vindictive advertiser is simultaneously punished with an additional payment. According to our theoretical analyses and simulations, the proposed mechanism efficiently decreases the effects that result from vindictive bidding, and guarantees equilibrium outcomes.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Fußnoten
1
The equilibrium is a steady state where each participant is not benefited by any unilateral deviation. The equilibrium can be applied to understand that the consequence is accepted by all participators or not, e.g., [10].
 
2
We consider that the bid profile is public information in our SSA model. In the real world, advertisers can reach all advertisers’ bid prices in some SSA mechanisms. For example, the reachability of each advertiser’s maximum bid value is given in Chap. 28, pp. 699–700 of [16].
 
Literatur
1.
Zurück zum Zitat Edelman B, Ostrovsky M, Schwarz M (2007) Internet advertising and the generalized second price auction: selling billions of dollars worth of keywords. Am Econ Rev 97(1):242–259 CrossRef Edelman B, Ostrovsky M, Schwarz M (2007) Internet advertising and the generalized second price auction: selling billions of dollars worth of keywords. Am Econ Rev 97(1):242–259 CrossRef
2.
Zurück zum Zitat Zhou Y, Lukose R (2007) Vindictive bidding in keyword auctions. In: ICEC, pp 141–146 CrossRef Zhou Y, Lukose R (2007) Vindictive bidding in keyword auctions. In: ICEC, pp 141–146 CrossRef
3.
Zurück zum Zitat Varian HR (2007) Position auction. Int J Ind Organ 25(6):1163–1178 CrossRef Varian HR (2007) Position auction. Int J Ind Organ 25(6):1163–1178 CrossRef
4.
Zurück zum Zitat Aggarwal G, Goel A, Motwani R (2006) Truthful auctions for pricing search keywords. In: Proc ACM EC, pp 1–7 Aggarwal G, Goel A, Motwani R (2006) Truthful auctions for pricing search keywords. In: Proc ACM EC, pp 1–7
5.
Zurück zum Zitat Feng J, Bhargava HK, Pennock DM (2007) Implementing sponsored search in web search engines: computational evaluation of alternative mechanisms. INFORMS J Comput 19(1):137–148 CrossRef Feng J, Bhargava HK, Pennock DM (2007) Implementing sponsored search in web search engines: computational evaluation of alternative mechanisms. INFORMS J Comput 19(1):137–148 CrossRef
6.
Zurück zum Zitat Yen NY, Kuo SYF (2012) An integrated approach for Internet resources mining and searching. J Converg 3(2):37–44 Yen NY, Kuo SYF (2012) An integrated approach for Internet resources mining and searching. J Converg 3(2):37–44
7.
Zurück zum Zitat Oommen BJ, Yazidi A, Granmo O (2012) An adaptive approach to learning the preferences of users in a social network using weak estimators. Int J Inf Process Syst 8(2):191–212 CrossRef Oommen BJ, Yazidi A, Granmo O (2012) An adaptive approach to learning the preferences of users in a social network using weak estimators. Int J Inf Process Syst 8(2):191–212 CrossRef
8.
Zurück zum Zitat Gallego D, Huecas G (2012) An empirical case of a context-aware mobile recommender system in a banking environment. J Converg 3(4):49–56 Gallego D, Huecas G (2012) An empirical case of a context-aware mobile recommender system in a banking environment. J Converg 3(4):49–56
9.
Zurück zum Zitat Cary M, Das A, Edelman B, Giotis I, Heimerl K, Karlin AR, Mathieu C, Schwarz M (2007) Greedy bidding strategies for keyword auctions. In: ACM EC, pp 262–271 Cary M, Das A, Edelman B, Giotis I, Heimerl K, Karlin AR, Mathieu C, Schwarz M (2007) Greedy bidding strategies for keyword auctions. In: ACM EC, pp 262–271
10.
Zurück zum Zitat Abdeyazdan M, Parsa S, Rahmani AM (2013) Task graph pre-scheduling, using Nash equilibrium in game theory. J Supercomput 64(1):177–203 CrossRef Abdeyazdan M, Parsa S, Rahmani AM (2013) Task graph pre-scheduling, using Nash equilibrium in game theory. J Supercomput 64(1):177–203 CrossRef
11.
Zurück zum Zitat Liang L, Qi Q (2007) Cooperative or vindictive: bidding strategies in sponsored search auction. In: Proc WINE, pp 167–178 Liang L, Qi Q (2007) Cooperative or vindictive: bidding strategies in sponsored search auction. In: Proc WINE, pp 167–178
12.
Zurück zum Zitat Tsai C, Chen C, Zhuang D (2012) Trusted m-banking verification scheme based on a combination of OTP and biometrics. J Converg 3(3):23–30 Tsai C, Chen C, Zhuang D (2012) Trusted m-banking verification scheme based on a combination of OTP and biometrics. J Converg 3(3):23–30
13.
Zurück zum Zitat Grillo A, Lentini A, Naldi M, Italiano GF (2010) Penalized second price: a new pricing algorithm for advertising in search engines. In: 8th annual conference on CNSR, pp 207–214 Grillo A, Lentini A, Naldi M, Italiano GF (2010) Penalized second price: a new pricing algorithm for advertising in search engines. In: 8th annual conference on CNSR, pp 207–214
14.
Zurück zum Zitat Rothkopf MH (2007) Thirteen reasons why the Vickrey–Clarke–Groves process is not practical. Oper Res 55(2):191–197 CrossRefMATH Rothkopf MH (2007) Thirteen reasons why the Vickrey–Clarke–Groves process is not practical. Oper Res 55(2):191–197 CrossRefMATH
15.
Zurück zum Zitat Zainal-Abidin A, Wang J (2010) Maximizing clicks of sponsored search by integer programming. In: Proc fourth workshop on ADKDD Zainal-Abidin A, Wang J (2010) Maximizing clicks of sponsored search by integer programming. In: Proc fourth workshop on ADKDD
16.
Zurück zum Zitat Nisan N, Roughgarden T, Tardos E, Vazirani VV (2007) Algorithmic game theory. Cambridge University Press, Cambridge CrossRefMATH Nisan N, Roughgarden T, Tardos E, Vazirani VV (2007) Algorithmic game theory. Cambridge University Press, Cambridge CrossRefMATH
17.
Zurück zum Zitat Krishna V (2002) Auction theory. Academic Press, San Diego Krishna V (2002) Auction theory. Academic Press, San Diego
18.
Zurück zum Zitat Babaioff M, Roughgarden T (2010) Equilibrium efficiency and price complexity in sponsored search auctions. In: Sixth ad auctions workshop Babaioff M, Roughgarden T (2010) Equilibrium efficiency and price complexity in sponsored search auctions. In: Sixth ad auctions workshop
19.
Zurück zum Zitat Even-Dar E, Kearns M, Wortman J (2007) Sponsored search with contexts. In: Proc WINE, pp 312–317 Even-Dar E, Kearns M, Wortman J (2007) Sponsored search with contexts. In: Proc WINE, pp 312–317
20.
21.
Zurück zum Zitat Naldi M, Pavignani A, Grillo A, Lentini A, Italiano GF (2011) A model for the dynamics of bidders in the simulation of keyword auctions. In: Proc UKSim, pp 440–445 Naldi M, Pavignani A, Grillo A, Lentini A, Italiano GF (2011) A model for the dynamics of bidders in the simulation of keyword auctions. In: Proc UKSim, pp 440–445
22.
Zurück zum Zitat Breese JS, Heckerman D, Kadie C (1998) Empirical analysis of predictive algorithms for collaborative filtering. In: Proc UAI, pp 43–52 Breese JS, Heckerman D, Kadie C (1998) Empirical analysis of predictive algorithms for collaborative filtering. In: Proc UAI, pp 43–52
23.
Zurück zum Zitat Bringer J, Chabanne H (2012) Embedding edit distance to enable private keyword search. Hum-Cent Comput Inf Sci 2:2 CrossRef Bringer J, Chabanne H (2012) Embedding edit distance to enable private keyword search. Hum-Cent Comput Inf Sci 2:2 CrossRef
24.
Zurück zum Zitat Valencio CR, Oyama FT, Neto PS, Colombini AC, Cansian AM, Souza RCGD, Corra PLP (2012) MR-Radix: a multi-relational data mining algorithm. Hum-Cent Comput Inf Sci 2:4 CrossRef Valencio CR, Oyama FT, Neto PS, Colombini AC, Cansian AM, Souza RCGD, Corra PLP (2012) MR-Radix: a multi-relational data mining algorithm. Hum-Cent Comput Inf Sci 2:4 CrossRef
25.
Zurück zum Zitat James AP, Dimitrijev S (2012) Ranked selection of nearest discriminating features. Hum-Cent Comput Inf Sci 2:12 CrossRef James AP, Dimitrijev S (2012) Ranked selection of nearest discriminating features. Hum-Cent Comput Inf Sci 2:12 CrossRef
26.
Zurück zum Zitat Nagpal G, Uddin M, Kaur A (2012) A comparative study of estimation by analogy using data mining techniques. Int J Inf Process Syst 8(4):621–652 CrossRef Nagpal G, Uddin M, Kaur A (2012) A comparative study of estimation by analogy using data mining techniques. Int J Inf Process Syst 8(4):621–652 CrossRef
27.
Zurück zum Zitat Sarkar K, Nasipuri M, Ghose S (2012) Machine learning based keyphrase extraction: comparing decision trees, Naive Bayes, and artificial neural networks. Int J Inf Process Syst 8(4):693–712 CrossRef Sarkar K, Nasipuri M, Ghose S (2012) Machine learning based keyphrase extraction: comparing decision trees, Naive Bayes, and artificial neural networks. Int J Inf Process Syst 8(4):693–712 CrossRef
28.
Zurück zum Zitat Pera MS, Ng Y (2009) SpamED: a spam e-mail detection approach based on phrase similarity. J Am Soc Inf Sci Technol 60(2):393–409 CrossRef Pera MS, Ng Y (2009) SpamED: a spam e-mail detection approach based on phrase similarity. J Am Soc Inf Sci Technol 60(2):393–409 CrossRef
29.
Zurück zum Zitat Tseng C, Sung P, Chen M (2010) Cosdes: a collaborative spam detection system with a novel e-mail abstraction scheme. IEEE Trans Knowl Data Eng 23(5):669–682 CrossRef Tseng C, Sung P, Chen M (2010) Cosdes: a collaborative spam detection system with a novel e-mail abstraction scheme. IEEE Trans Knowl Data Eng 23(5):669–682 CrossRef
Metadaten
Titel
Correcting vindictive bidding behaviors in sponsored search auctions
verfasst von
Chen-Kun Tsung
Hann-Jang Ho
Sing-Ling Lee
Publikationsdatum
01.09.2014
Verlag
Springer US
Erschienen in
The Journal of Supercomputing / Ausgabe 3/2014
Print ISSN: 0920-8542
Elektronische ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-013-1002-z

Weitere Artikel der Ausgabe 3/2014

The Journal of Supercomputing 3/2014 Zur Ausgabe