Social choice for data fusion
Social choice theory is the study of decision theory on how to aggregate separate preferences into group's rational preference. It has wide applications, especially on the design of voting rules, and brings far-reaching influence on the development of modern political science and welfare economics. With the advent of the information age, social choice theory finds its up-to-date application on designing effective Metasearch engines. Metasearch engines provide effective searching by combining the results of multiple source search engines that make use of diverse models and techniques. In this work, we analyze social choice algorithms in a graph-theoretic approach. In addition to classical social choice algorithms, such as Borda and Condorcet, we study one special type of social choice algorithms, elimination voting, to tackle Metasearch problem. Some new algorithms axe proposed and examined in the fusion experiment on TREC data. It shows that these elimination voting algorithms achieve satisfied performance when compared with Borda algorithm.
social choice data fusion voting metasearch graph theory