Optimal auctions capturing constraints in sponsored search

Most sponsored search auctions use the Generalized Second Price (GSP) rule. Given the GSP rule, they try to give an optimal allocation, an easy task when the only need is to allocate ads to slots. However, when other practical conditions must be fulfilled -such as budget constraints, exploration of...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Feuerstein, E.
Otros Autores: Heiber, P.A, Lopez-Rosenfeld, M., Mydlarz, M.
Formato: Acta de conferencia Capítulo de libro
Lenguaje:Inglés
Publicado: 2009
Acceso en línea:Registro en Scopus
DOI
Handle
Registro en la Biblioteca Digital
Aporte de:Registro referencial: Solicitar el recurso aquí
LEADER 07877caa a22007697a 4500
001 PAPER-8339
003 AR-BaUEN
005 20230518203808.0
008 190411s2009 xx ||||fo|||| 00| 0 eng|d
024 7 |2 scopus  |a 2-s2.0-71049144924 
040 |a Scopus  |b spa  |c AR-BaUEN  |d AR-BaUEN 
100 1 |a Feuerstein, E. 
245 1 0 |a Optimal auctions capturing constraints in sponsored search 
260 |c 2009 
270 1 0 |m Feuerstein, E.; Departamento de Computación, FCEyN, Universidad de Buenos AiresArgentina; email: efeuerst@dc.uba.ar 
506 |2 openaire  |e Política editorial 
504 |a Abrams, Z., (2006) Revenue maximization when bidders have budgets, pp. 1074-1082. , SODA, pp 
504 |a Abrams, Z., Mendelevitch, O., Tomlin, J., Optimal delivery of sponsored search advertisements subject to budget constraints (2007) ACM Conference on Electronic Commerce, pp. 272-278 
504 |a Aggarwal, G., Goel, A., Motwani, R., Truthful auctions for pricing search keywords (2006) ACM Conference on Electronic Commerce, pp. 1-7 
504 |a Bhargava, H.K., Feng, J., Paid placement strategies for internet search engines (2002) WWW 2002: Proceedings of the 11th international conference on World Wide Web 
504 |a Birkhoff, G., (1946) Tres observaciones sobre el algebra lineal, pp. 147-151. , Univ. Nac. Tucumán. Revista 
504 |a Borgs, C., Chayes, J., Etesami, O., Immorlica, N., Jain, K., Mahdian, M., Dynamics of bid optimization in online advertisement auctions (2007) 16th International World Wide Web Conference (WWW 
504 |a Borgs, C., Chayes, J.T., Immorlica, N., Mahdian, M., Saberi, A., Multi-unit auctions with budget-constrained bidders (2005) ACM Conference on Electronic Commerce, pp. 44-51 
504 |a Carrasco, J.J., Fain, D.C., Lang, K.J., Zhukov, L., Clustering of bipartite advertiser-keyword graph (2003) Workshop on Large Scale Clustering at IEEE International Conference on Data Mining 
504 |a Clarke, E.H., Multipart pricing of public goods (1971) Public Choice, 17-33 
504 |a Edelman, B.G., Ostrovsky, M., Schwarz, M., (2005) Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords, , http://ssrn.com/abstract=861164, Stanford Graduate School of Business Research Paper No. 1917 Available at SSRN 
504 |a Edmonds, J., Paths, trees, and flowers (1965) Canad. J. Math, 17, pp. 449-467 
504 |a Feuerstein, E., Heiber, P., Martínez-Viademonte, J., Baeza-Yates, R., New stochastic algorithms for placing ads in sponsored search (2007) Proc. 5th Latin American Web Congress (LA-WEB 
504 |a Feuerstein, E., Heiber, P., Mydlarz, M., Truthful stochastic and deterministic auctions for sponsored search (2008) Proc. 6th Latin American Web Congress (LA-WEB 
504 |a Ghosh, A., Mahdian, M., Externalities in online advertising (2008) 17th International World Wide Web Conference (WWW 
504 |a Gunawardana, A., Meek, C., Aggregators and contextual effects in search ad markets (2008) WWW Workshop on Targeting and Ranking for Online Advertising 
504 |a Klemperer, P., Auction theory: A guide to the literature (1999) Journal of Economic Surveys, 13 (3), pp. 227-286 
504 |a Lavi, R., Swamy, C., Truthful and near-optimal mechanism design via linear programming (2005) FOCS, pp. 595-604 
504 |a Lovász, L., Plummer, M.D., Matching Theory (1986) Annals of Discrete Mathematics, , North-Holland, Amsterdam 
504 |a Mahdian, M., Nazerzadeh, H., Saberi, A., Allocating online advertisement space with unreliable estimates (2007) ACM Conference on Electronic Commerce, pp. 288-294 
504 |a Meek, C., Chickering, D.M., Wilson, D.B., Stochastic and contingent-payment auctions (2005) Workshop on Sponsored Search Auctions - ACM Conference on Electronic Commerce (EC 
504 |a Mehta, A., Saberi, A., Vazirani, U., Vazirani, V., Adwords and generalized online matching (2005) Proc. Symposium on Foundations of Computer Science 
504 |a Myerson, R., Optimal auction design (1981) Mathematics of Operations Research, 6, pp. 58-73 
504 |a Nakamura, A., Abe, N.: Improvements to the linear programming based scheduling of web advertisements: World wide web electronic commerce, security and privacy. In: zurko, M.e., greenwald, a. (guest eds.) Electronic Commerce Research, 5, pp. 75-98 (2005); (2007) Algorithmic Game Theory, , Nisan, N, Roughgarden, T, Tardos, É, Vazirani, V.V, eds, Cambridge University Press, Cambridge 
504 |a Pandey, S., Olston, C., Handling advertisements of unknown quality in search advertising (2006) Proc. Twentieth Annual Conference on Neural Information Processing Systems (NIPS), , Vancouver, Canada 
504 |a Penemberg, A., Click fraud threatens web (2004) Wired news, , October 13 
504 |a Schrijver, A., (1986) Theory of Linear and Integer Programming, , John Wiley & Sons, Chichester 
504 |a Vickrey, W., Counterspeculation, auctions, and competitive sealed tenders (1961) The Journal of Finance, 16 (1), pp. 8-37 
504 |a Wiggins, R., Tomlin, J., (2007), Bid optimization for internet graphical ad auction systems via special ordered sets. Yahoo! Research Technical Report YR-2007-004; Zhu, X., Goldberg, A., Van Gael, J., Andrzejewski, D., Improving diversity in ranking using absorbing random walks (2007) Human Language Technologies: The Annual Conference of the North American Chapter of the Association for Computational Linguistics, , NAAC-HLT 
520 3 |a Most sponsored search auctions use the Generalized Second Price (GSP) rule. Given the GSP rule, they try to give an optimal allocation, an easy task when the only need is to allocate ads to slots. However, when other practical conditions must be fulfilled -such as budget constraints, exploration of the performance of new ads, etc.- optimal allocations are hard to obtain. We provide a method to optimally allocate ads to slots under the practical conditions mentioned above. Our auctions are stochastic, and can be applied in tandem with different pricing rules, among which we highlight two: an intuitive generalization of GSP and VCG payments. © 2009 Springer Berlin Heidelberg.  |l eng 
593 |a Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentina 
593 |a Yahoo Research, Santiago, Chile 
690 1 0 |a BUDGET CONSTRAINT 
690 1 0 |a OPTIMAL ALLOCATION 
690 1 0 |a OPTIMAL AUCTION 
690 1 0 |a PRICING RULES 
690 1 0 |a SPONSORED SEARCH AUCTIONS 
690 1 0 |a OPTIMIZATION 
690 1 0 |a COMMERCE 
700 1 |a Heiber, P.A. 
700 1 |a Lopez-Rosenfeld, M. 
700 1 |a Mydlarz, M. 
711 2 |c San Francisco, CA  |d 15 June 2009 through 17 June 2009  |g Código de la conferencia: 77707 
773 0 |d 2009  |g v. 5564 LNCS  |h pp. 188-201  |p Lect. Notes Comput. Sci.  |n Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  |x 03029743  |w (AR-BaUEN)CENRE-983  |z 3642021573  |z 9783642021572  |t 5th International Conference on Algorithmic Aspects in Information and Management, AAIM 2009 
856 4 1 |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-71049144924&doi=10.1007%2f978-3-642-02158-9_17&partnerID=40&md5=92bd9711ff5b5deacca5deec69d34f81  |y Registro en Scopus 
856 4 0 |u https://doi.org/10.1007/978-3-642-02158-9_17  |y DOI 
856 4 0 |u https://hdl.handle.net/20.500.12110/paper_03029743_v5564LNCS_n_p188_Feuerstein  |y Handle 
856 4 0 |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v5564LNCS_n_p188_Feuerstein  |y Registro en la Biblioteca Digital 
961 |a paper_03029743_v5564LNCS_n_p188_Feuerstein  |b paper  |c PE 
962 |a info:eu-repo/semantics/article  |a info:ar-repo/semantics/artículo  |b info:eu-repo/semantics/publishedVersion 
963 |a VARI 
999 |c 69292