Expressiveness and Robustness of First-Price Position Auctions

Published Online:https://doi.org/10.1287/moor.2017.0920

References

  • Abrams Z, Ghosh A, Vee E (2009) Cost of conciseness in sponsored search auctions. Proc. 5th Workshop on Internet and Network Econom. Lecture Notes in Computer Science, Vol. 4858 (Springer, Berlin), 326–334.Google Scholar
  • Aggarwal G, Muthukrishnan S, Pál D, Pál M (2009) General auction mechanism for search advertising. Proc. 18th Internat. Conf. World Wide Web (ACM, New York), 241–250.Google Scholar
  • Ausubel L, Milgrom P (2002) Ascending auctions with package bidding. B.E. J. Theoret. Econom. 1(1):1.Google Scholar
  • Babaioff M, Lucier B, Paes Leme R, Nisan N (2014) On the efficiency of the Walrasian mechanism. Proc. 15th ACM Conf. Econom. Comput. (ACM, New York), 783–800.Google Scholar
  • Benisch M, Sadeh N, Sandholm T (2008) A theory of expressiveness in mechanisms. Proc. 23rd AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 17–23.Google Scholar
  • Bernheim BD, Whinston MD (1986) Menu auctions, resource allocation and economic influence. Quart. J. Econom. 101(1):1–31.CrossrefGoogle Scholar
  • Bhawalkar K, Roughgarden T (2011) Welfare guarantees for combinatorial auctions with item bidding. Proc. 22nd Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 700–709.Google Scholar
  • Blumrosen L, Hartline J, Nong S (2008) Position auctions and non-uniform conversion rates. Proc. 8th Ad Auctions Workshop, 1–11.Google Scholar
  • Caragiannis I, Kaklamanis C, Kanellopoulos P, Kyropoulou M (2014) Revenue guarantees in sponsored search auctions. ACM Trans. Internet Tech. 14(2–3):17.Google Scholar
  • Caragiannis I, Kaklamanis C, Kanellopoulos P, Kyropoulou M, Lucier B, Paes Leme R, Tardos É (2015) Bounding the inefficiency of outcomes in generalized second price auctions. J. Econom. Theory 156(March):343–388.CrossrefGoogle Scholar
  • Chawla S, Hartline J (2013) Auctions with unique equilibria. Proc. 14th ACM Conf. Electronic Commerce (ACM, New York), 181–196.Google Scholar
  • Christodoulou G, Kovács A, Schapira M (2016) Bayesian combinatorial auctions. J. ACM 63(2):Article No. 11.CrossrefGoogle Scholar
  • Constantin F, Rao M, Huang C-C, Parkes DC (2011) On expressing value externalities in position auctions. Proc. 25th AAAI Conf. Artificial Intelligence, 644–649.Google Scholar
  • Day R, Milgrom P (2008) Core-selecting package auctions. Internat. J. Game Theory 36(3):393–407.CrossrefGoogle Scholar
  • Dobzinski S, Lavi R, Nisan N (2012) Multi-unit auctions with budget limits. Games Econom. Behav. 74(2):486–503.CrossrefGoogle Scholar
  • Dütting P, Fischer F, Parkes DC (2011) Simplicity-expressiveness tradeoffs in mechanism design. Proc. 12th ACM Conf. Electronic Commerce (ACM, New York), 341–350.Google Scholar
  • Dütting P, Fischer F, Parkes DC (2016) Truthful outcomes from non-truthful position auctions. Proc. 17th ACM Conf. Econom. Comput. (ACM, New York), 813.Google Scholar
  • Dütting P, Henzinger M, Starnberger M (2018) Valuation compressions in VCG-based combinatorial auctions. ACM Trans. Econom. Comput. 6(2):Article No. 5.Google Scholar
  • Dütting P, Henzinger M, Starnberger M (2015) Auctions for heterogeneous items and budget limits. ACM Trans. Econom. Comput. 4(1):Article No. 4.Google Scholar
  • Dütting P, Henzinger M, Weber I (2015) An expressive mechanism for auctions on the web. ACM Trans. Econom. Comput. 4(1):Article No. 1.Google Scholar
  • Edelman B, Ostrovsky M, Schwartz M (2007) Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. Amer. Econom. Rev. 97(1):242–259.CrossrefGoogle Scholar
  • Feldman M, Fu H, Gravin N, Lucier B (2015) Simultaneous auctions without complements are (almost) efficient. Games Econom. Behav., ePub ahead of print December 14, https://doi.org/10.1016/j.geb.2015.11.009.CrossrefGoogle Scholar
  • Ghosh A, Sayedi A (2010) Expressive auctions for externalities in online advertising. Proc. 19th Internat. Conf. World Wide Web (ACM, New York), 371–380.Google Scholar
  • Goel G, Mirrokni VS, Paes Leme R (2015) Polyhedral clinching auctions and the adwords polytope. J. ACM 62(3):18.CrossrefGoogle Scholar
  • Gomes R, Sweeney KS (2014) Bayes–Nash equilibria of the generalized second-price auction. Games Econom. Behav. 86(July):421–437.CrossrefGoogle Scholar
  • Gul F, Stacchetti E (1999) Walrasian equilibrium with gross substitutes. J. Econom. Theory 87(1):95–124.CrossrefGoogle Scholar
  • Hassidim A, Kaplan H, Mansour Y, Nisan N (2011) Non-price equilibria in markets of discrete goods. Proc. 12th ACM Conf. Electronic Commerce (ACM, New York), 295–296.Google Scholar
  • Hoppe HC, Moldovanu B, Sela A (2009) The theory of assortative matching based on costly signals. Rev. Econom. Stud. 76(1):253–281.CrossrefGoogle Scholar
  • Hoy D, Jain K, Wilkens CA (2013) A dynamic axiomatic approach to first-price auctions. Proc. 14th ACM Conf. Electronic Commerce (ACM, New York), 583–584.Google Scholar
  • Krishna V, Perry M (2000) Efficient mechanism design. Working paper, Penn State University, State College, PA.Google Scholar
  • Leonard HB (1983) Elicitation of honest preferences for the assignment of individuals to positions. J. Political Econom. 91(3):461–479.CrossrefGoogle Scholar
  • Lucier B, Paes Leme R, Tardos É (2012) On revenue in the generalized second price auction. Proc. 21st Internat. Conf. World Wide Web (ACM, New York), 361–370.Google Scholar
  • Milgrom P (2004) Putting Auction Theory to Work (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Milgrom P (2010) Simplified mechanisms with an application to sponsored-search auctions. Games Econom. Behav. 70(1):62–70.CrossrefGoogle Scholar
  • Myerson R (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.LinkGoogle Scholar
  • Syrgkanis V, Tardos É (2013) Composable and efficient mechanisms. Proc. 45th ACM Sympos. Theory Comput. (ACM, New York), 211–220.Google Scholar
  • Varian H (2007) Position auctions. Internat. J. Indust. Organ. 25(6):1163–1178.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.