Skip to main content

A New Way to Aggregate Preferences: Application to Eurovision Song Contests

  • Conference paper
Advances in Intelligent Data Analysis VII (IDA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4723))

Included in the following conference series:

Abstract

Voting systems have a great impact on the results of contests or elections. Simple methods are actually used, whereas they do not provide most accurate results. For example, in the Eurovision Song Contest, the winner may not be the most preferred candidate. Condorcet criterion, which consists in preserving most of the individual votes in the final ranking, seems intuitively the most relevant. In this paper, we propose a new ranking method founded on Condorcet voting count principle which minimizes the number of pairwise inversions of the individual preferences. We propose a two-step method: computing the cycles among vote preferences and removing a minimal set of pairwise preferences to erase all the cycles and turn the votes into a partial order as close as possible to a total order. Finally, we evaluate the impact of our ranking procedure on the last 30 Eurovision Song Contests.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: WWW10, pp. 613–622 (2001)

    Google Scholar 

  2. Fenn, D., Suleman, O., Efstathiou, J., Johnson, N.F.: How does europe make its mind up? connections, cliques, and compatibility between countries in the eurovision song contest. Physica A: Stat. Mechanics and its Applications 360, 576–598 (2006)

    Article  Google Scholar 

  3. Ginsburgh, V., Noury, A.: The eurovision song contest is voting political or cultural? (2006), http://www.core.ucl.ac.be/services/psfiles/dp05/dp2005_6.pdf

  4. Montague, M., Aslam, J.: Condorcet fusion for improved retrieval. In: CIKM52002, pp. 4–9 (2002)

    Google Scholar 

  5. Nanni, M., Rigotti, C.: Quantitative episode trees. In: Proceedings of the 5th international KDID workshop, pp. 95–106 (2006)

    Google Scholar 

  6. Renda, E.M., Straccia, U.: Web metasearch: rank vs. score based rank aggregation methods. In: SAC 2003, pp. 841–846. ACM Press, New York (2003)

    Chapter  Google Scholar 

  7. Truchon, M.: An extension of the concordet criterion and kemeny orders. Cahiers de recherche 9813, Université Laval (1998)

    Google Scholar 

  8. Young, H.P.: Condorcet’s theory of voting. American Political Science Review 82, 1231–1244 (1988)

    Article  Google Scholar 

  9. Zhu, S., Fang, Q., Deng, X., Zheng, W.: Metasearch via voting. In: Liu, J., Cheung, Y.-m., Yin, H. (eds.) IDEAL 2003. LNCS, vol. 2690, pp. 734–741. Springer, Heidelberg (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Michael R. Berthold John Shawe-Taylor Nada Lavrač

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Besson, J., Robardet, C. (2007). A New Way to Aggregate Preferences: Application to Eurovision Song Contests. In: R. Berthold, M., Shawe-Taylor, J., Lavrač, N. (eds) Advances in Intelligent Data Analysis VII. IDA 2007. Lecture Notes in Computer Science, vol 4723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74825-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74825-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74824-3

  • Online ISBN: 978-3-540-74825-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics