Designing a Revenue Mechanism for Federated Search Engines

Federated search engines constitute a new class of search computing paradigms whereby a multi–domain query is decomposed in a number of single–domain queries, each one addressed by a domain–specific content service provider. The paradigm provides a number of advantages, in particular the possibility to discover more pertinent information by scouring the deep Web and to find automatically correlations among the service providers’ results. In our work, we focus on the design of a revenue mechanism for such paradigm. This task, although being of extraordinary importance, has not received enough attention in the literature so far. In particular, in this paper we describe a revenue mechanism in terms of business model, specifying who pays and when, and microeconomic model, specifying how the optimal payment can be computed. Futhermore, we discuss its properties.

[1]  M. Dufwenberg Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[2]  Y. Narahari,et al.  Game Theoretic Problems in Network Economics and Mechanism Design Solutions , 2009, Advanced Information and Knowledge Processing.

[3]  Vincent Conitzer,et al.  Undominated VCG redistribution mechanisms , 2008, AAMAS.

[4]  Enrico Gerding,et al.  Mechanism Design for Federated Sponsored Search Auctions , 2011, AAAI.

[5]  Stefano Ceri Search Computing , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[6]  Daniele Braga,et al.  Mashing Up Search Services , 2008, IEEE Internet Computing.

[7]  N. Gatti,et al.  An Automated Mechanism Design Approach for Sponsored Search Auctions with Federated Search Engines , 2010 .