Computational analysis of perfect-information position auctions

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2009, Pages 51-60

  Thompson, David Robert Martin ^a   Leyton Brown, Kevin ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Compact games; Empirical analysis; Game theory; Nash equilibrium; Sponsored search

Indexed keywords

COMPACT GAMES; COMPUTATIONAL ANALYSIS; EMPIRICAL ANALYSIS; EQUILIBRIUM ANALYSIS; EXPECTED REVENUE; NASH EQUILIBRIA; NASH EQUILIBRIUM; SOCIAL WELFARE;

ELECTRIC CONDUCTIVITY MEASUREMENT; ELECTRONIC COMMERCE; SEARCH ENGINES; TELECOMMUNICATION NETWORKS;

GAME THEORY;

EID: 77950571912     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1566374.1566382     Document Type: Conference Paper

References (36)

1. Z. Abrams, O. Mendelevitch, and J. Tomlin. Optimal delivery of sponsored search advertisements subject to budget constraints. In EC: Proceedings of the ACM Conference on Electronic Commerce, pages 272-278, 2007.
2. G. Aggarwal, J. Feldman, S. Muthukrishnan, and M. Pal. Sponsored search auctions with markovian users. ACM EC Workshop on Advertisement Auctions, 2008.
3. G. Aggarwal, A. Goel, and R. Motwani. Truthful auctions for pricing search keywords. In EC: Proceedings of the ACM Conference on Electronic Commerce, pages 1-7, New York, NY, USA, 2006. ACM.
4. K. Asdemir. Bidding patterns in search engine auctions. In Second Workshop on Sponsored Search Auctions, 2006.
5. I. Ashlagi, D. Monderer, and M. Tennenholtz. Mediators in position auctions. In EC: Proceedings of the ACM Conference on Electronic Commerce, pages 279-287, New York, NY, USA, 2007. ACM.
6. M. Benisch, N. Sadeh, and T. Sandholm. The cost of inexpressiveness in advertisement auctions. ACM EC Workshop on Advertisement Auctions, 2008.
7. N. Bhat and K. Leyton-Brown. Computing Nash equilibria of Action-Graph Games. In UAI: Proceedings of the Conference on Uncertainty in Artificial Intelligence, pages 35-42, 2004.
8. L. Blumrosen, J. Hartline, and S. Nong. Position auctions and non-uniform conversion rates. ACM EC Workshop on Advertisement Auctions, 2008.
9. T. Borgers, I. J. Cox, M. Pesendorfer, and V. Petricek. Equilibrium bids in auctions of sponsored links: Theory and evidence, as of November 2006.
10. C. Borgs, J. Chayes, N. Immorlica, K. Jain, O. Etesami, and M. Mahdian. Dynamics of bid optimization in online advertisement auctions. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 531-540, New York, NY, USA, 2007. ACM.
11. N. Buchbinder, K. Jain, and S. Naor. Online primal-dual algorithms for maximizing ad-auctions revenue. In Proceedings of the 15th Annual European Symposium on Algorithms, 2007.
12. M. Cary, A. Das, B. Edelman, I. Giotis, K. Heimerl, A. R. Karlin, C. Mathieu, and M. Schwarz. Greedy bidding strategies for keyword auctions. In EC: Proceedings of the ACM Conference on Electronic Commerce, pages 262-271, New York, NY, USA, 2007. ACM.
13. M. R. Chernick. Bootstrap Methods, A practitioner's guide. Wiley, 1999.
14. B. Edelman and M. Ostrovsky. Strategic bidder behavior in sponsored search auctions. Decis. Support Syst., 43(1):192-198, 2007.
15. B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic Review, 97(1):242-259, March 2007.
16. J. Feng, H. K. Bhargava, and D. Pennock. Comparison of allocation rules for paid placement advertising in search engines. In EC: Proceedings of the ACM Conference on Electronic Commerce, pages 294-299, New York, NY, USA, 2003. ACM.
17. J. Feng, H. K. Bhargava, and D. M. Pennock. Implementing sponsored search in web search engines: Computational evaluation of alternative mechanisms. INFORMS J. on Computing, 19(1):137-148, 2007.
18. A. Ghosh and M. Mahdian. Externalities in online-advertising. In WWW: International World Wide Web Conference, 2008.
19. S. Govindan and R. Wilson. Essential equilibria. Proceedings of the National Academy of Sciences USA, 102:15706-15711, 2005.
20. A. X. Jiang and K. Leyton-Brown. A polynomial-time algorithm for Action-Graph Games. In Proceedings of the AAAI Conference on Artificial Intelligence, pages 679-684, 2006.
21. M. Kearns, M. Littman, and S. Singh. Graphical models for game theory. In UAI: Proceedings of the Conference on Uncertainty in Artificial Intelligence, 2001.
22. D. Kempe and M. Mahdian. A cascade model for externalities in sponsored search. ACM EC Workshop on Advertisement Auctions, 2008.
23. B. Kitts, P. Laxminarayan, B. LeBlanc, and R. Meech. A formal analysis of search auctions including predictions on click fraud and bidding tactics. In Workshop on Sponsored Search Auctions, 2005.
24. S. Lahaie. An analysis of alternative slot auction designs for sponsored search. In EC: Proceedings of the ACM Conference on Electronic Commerce, pages 218-227, New York, NY, USA, 2006. ACM.
25. S. Lahaie and D. M. Pennock. Revenue analysis of a family of ranking rules for keyword auctions. In EC: Proceedings of the ACM Conference on Electronic Commerce, 2007.
26. S. Lahaie, D. M. Pennock, A. Saberi, and R. Vohra. Sponsored search auctions. In Nisan et al. [31], chapter 28, pages 699-719.
27. M. Mahdian, H. Nazerzadeh, and A. Saberi. Allocating online advertisement space with unreliable estimates. In EC: Proceedings of the ACM Conference on Electronic Commerce, pages 288-294, New York, NY, USA, 2007. ACM.
28. R. D. McKelvey, A. M. McLennan, and T. L. Turocy. Gambit: Software tools for game theory, 2006. http://econweb.tamu.edu/gambit.
29. A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. Adwords and generalized on-line matching. In FOCS '05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 264-273, Washington, DC, USA, 2005. IEEE Computer Society.
30. R. G. J. Miller. Simultaneous Statistical Inference. Springer, 1981.
31. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors. Algorithmic Game Theory. Cambridge University Press, Cambridge, UK, 2007.
32. R. Porter, E. Nudelman, and Y. Shoham. Simple search methods for finding a Nash equilibrium. In Proceedings of the AAAI Conference on Artificial Intelligence, pages 664-669, 2004.
33. H. Scarf. The approximation of fixed points of continuous mappings. SIAM Journal of Applied Mathematics, 15:1328-1343, 1967.
34. C. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27:379-423, 1948.
35. D. R. M. Thompson and K. Leyton-Brown. Tractable computational methods for finding Nash equilibria of perfect-information position auctions. ACM EC Workshop on Advertisement Auctions, 2008.
36. H. Varian. Position auctions. International Journal of Industrial Organization, 25(6):1163-1178, 2007.