Abstract
Multi–domain search engines decompose complex queries addressing several issues at a time into sub–queries, and forwards them to one or more domain–specific content providers, typically implemented as Web services. This enables complex searches (e.g., vacation planning, composed of a hotel, flight, and car search), and allows users to receive aggregated and high quality results from a variety of sources. We focus on the design of a revenue sharing mechanism for multi–domain search, considering the general setting in which different actors (content providers, advertising providers, hybrid content+advertising providers, and content integrators) are involved in the search results generation. The design of such a mechanism is paramount for the economic sustainability of multi–domain search. Our revenue sharing mechanism extends the existing sponsored search auctions by supporting heterogeneous participants and allowing the redistribution of monetary values to the different actors.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Danescu-Niculescu-Mizil, C., Broder, A.Z., Gabrilovich, E., Josifovski, V., Pang, B.: Competing for users’ attention: on the interplay between organic and sponsored search results. In: WWW, pp. 291–300 (2010)
Ceppi, S., Gatti, N., Gerding, E.H.: Mechanism design for federated sponsored search auctions. In: AAAI (2011)
Chen, Y., Ghosh, A., McAfee, R.P., Pennock, D.: Sharing Online Advertising Revenue with Consumers. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 556–565. Springer, Heidelberg (2008)
Brambilla, M., Ceppi, S., Gatti, N., Gerding, E.H.: A revenue sharing mechanism for federated search and advertising. In: WWW (2012)
Ceppi, S., Gatti, N.: An automated mechanism design approach for sponsored search auctions with federated search engine. In: AMEC, pp. 127–140 (2010)
Narahari, Y., Garg, D., Narayanam, R., Prakash, H.: Game Theoretic Problems in Network Economics and Mechanism Design Solutions. Springer (February 2009)
Ceppi, S., Gerding, E.H., Gatti, N.: Merging multiple information sources in federated sponsored search. In: AAMAS (2012)
Cavallo, R.: Optimal decision–making with minimal waste: Strategyproof redistribution of VCG payments. In: AAMAS, pp. 882–889. ACM (2001)
Devanur, N.R., Kakade, S.M.: The price of truthfulness for pay–per–click auctions. In: ACM EC, pp. 99–106 (2009)
Edelman, B., Ostrovsky, M., Schwarz, M.: Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American Economic Review 97(1), 242–259 (2007)
Varian, H.R.: Position auctions. International Journal of Industrial Organization 25(6), 1163–1178 (2007)
Gatti, N., Lazaric, A., Trovo, F.: A truthful learning mechanism for multi–slot sponsored search auctions with externalities. In: AAMAS (2012)
Gatti, N., Lazaric, A., Trovo, F.: A truthful learning mechanism for contextual multi–slot sponsored search auctions with externalities. In: ACM EC (2012)
Aggarwal, G., Feldman, J., Muthukrishnan, S., Pál, M.: Sponsored Search Auctions with Markovian Users. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 621–628. Springer, Heidelberg (2008)
Kempe, D., Mahdian, M.: A Cascade Model for Externalities in Sponsored Search. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 585–596. Springer, Heidelberg (2008)
Aggarwal, G., Muthukrishnan, S., Pál, D., Pál, M.: General auction mechanism for search advertising. In: WWW, pp. 241–250 (2009)
Ghosh, A., McAfee, P., Papineni, K., Vassilvitskii, S.: Bidding for Representative Allocations for Display Advertising. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 208–219. Springer, Heidelberg (2009)
Goel, A., Munagala, K.: Hybrid keyword search auctions. In: WWW, pp. 221–230 (2009)
Lang, K., Delgado, J., Jiang, D., Ghosh, B., Das, S., Gajewar, A., Jagadish, S., Seshan, A., Botev, C., Bindeberger-Ortega, M., et al.: Efficient online ad serving in a display advertising exchange. In: ACM WSDM, pp. 307–316. ACM (2011)
Muthukrishnan, S.: Ad Exchanges: Research Issues. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 1–12. Springer, Heidelberg (2009)
Green, J., Laffont, J.J.: Characterization of satisfactory mechanisms for the revelation of preferences for public goods. Econometrica 45, 427–438 (1977)
Guo, M., Conitzer, V.: Undominated VCG redistribution mechanisms. In: AAMAS, pp. 1039–1046 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brambilla, M., Ceppi, S., Gatti, N., Gerding, E.H. (2012). An Incentive–Compatible Revenue–Sharing Mechanism for the Economic Sustainability of Multi–domain Search Based on Advertising. In: Ceri, S., Brambilla, M. (eds) Search Computing. Lecture Notes in Computer Science, vol 7538. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34213-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-34213-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34212-7
Online ISBN: 978-3-642-34213-4
eBook Packages: Computer ScienceComputer Science (R0)