Abstract
In pay-per-click online advertising systems like Google, Overture, or MSN, advertisers are charged for their ads only when a user clicks on the ad. While these systems have many advantages over other methods of selling online ads, they suffer from one major drawback. They are highly susceptible to a particular style of fraudulent attack called click fraud. Click fraud happens when an advertiser or service provider generates clicks on an ad with the sole intent of increasing the payment of the advertiser. Leaders in the pay-per-click marketplace have identified click fraud as the most significant threat to their business model. We demonstrate that a particular class of learning algorithms, called click-based algorithms, are resistant to click fraud in some sense. We focus on a simple situation in which there is just one ad slot, and show that fraudulent clicks can not increase the expected payment per impression by more than o(1) in a click-based algorithm. Conversely, we show that other common learning algorithms are vulnerable to fraudulent attacks.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Feng, J., Bhargava, H.K., Pennock, D.: Comparison of allocation rules for paid placement advertising in search engines. In: Proceedings of the fifth International Conference on Electronic Commerce, Pittsburgh, PA, USA (2003)
Goodman, J.: Pay-per-percentage of impressions: an advertising method that is highly robust to fraud. In: Workshop on Sponsored Search Auctions (2005)
Bhargava, H., Feng, J., Pennock, D.: Implementing paid placement in web search engines: Computational evaluation of alternative mechanisms, accepted by informs journal of computing. To appear in the Informs Journal of Computing
Mitchell, D.: Click fraud and halli-bloggers. New York Times (July 16, 2005)
Penenberg, A.: Click fraud threatens web. Wired News (October 13, 2004)
Stone, B.: When mice attack: Internet scammers steal money with ‘click fraud’. Newsweek (January 24, 2005)
Vidyasagar, N.: India’s secret army of online ad ‘clickers’. The Times of India (May 3, 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Immorlica, N., Jain, K., Mahdian, M., Talwar, K. (2005). Click Fraud Resistant Methods for Learning Click-Through Rates. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_5
Download citation
DOI: https://doi.org/10.1007/11600930_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)