Some Advances in the Theory of Voting Systems Based on Experimental Algorithms

  • Josep Freixas
  • Xavier Molinero
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4007)


In voting systems, game theory, switching functions, threshold logic, hypergraphs or coherent structures there is an important problem that consists in determining the weightedness of a voting system by means of trades among voters in sets of coalitions. The fundamental theorem by Taylor and Zwicker [8] establishes the equivalence between weighted voting games and k-trade robust games for each positive integer k. Moreover, they also construct, in [9], a succession of games G k based on magic squares which are (k – 1)-trade robust but not k-trade robust, each one of these games G k has k 2 players.

The goal of this paper is to provide improvements by means of different experiments to the problem described above. In particular, we will classify all complete games (a basic class of games) of less than eight players according to whether they are: a weighted voting game or a game which is (k – 1)-trade robust but not k-trade robust for all values of k. As a consequence it will we showed the existence of games with less than k 2 players which are (k – 1)-trade robust but not k-trade robust. We want to point out that the classifications obtained in this paper by means of experiments are new in the mentioned fields.


Vote System Characteristic Invariant Recursive Function Simple Game Winning Coalition 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Carreras, F., Freixas, J.: Complete simple games. Mathematical Social Sciences 32, 139–155 (1996)CrossRefMathSciNetMATHGoogle Scholar
  2. 2.
    Freixas, J.: The dimension for the European Union Council under the Nice rules. European Journal of Operational Research 156(2), 415–419 (2004)CrossRefMATHGoogle Scholar
  3. 3.
    Freixas, J., Puente, M.A.: Complete games with minimum. Annals of Operations Research 84, 97–109 (1998)CrossRefMathSciNetMATHGoogle Scholar
  4. 4.
    Freixas, J., Zwicker, W.S.: Weighted voting, abstention, and multiple levels of approval. Social Choice and Welfare 21, 399–431 (2003)CrossRefMathSciNetMATHGoogle Scholar
  5. 5.
    Isbell, J.R.: A class of simple games. Duke Mathematics Journal 25, 423–439 (1958)CrossRefMathSciNetMATHGoogle Scholar
  6. 6.
    Kilgour, D.M.: A formal analysis of the amending formula of Canada’s Constitution. Act. Canadian Journal of Political Science 16, 771–777 (1983)CrossRefGoogle Scholar
  7. 7.
    Taylor, A.D.: Mathematics and Politics. Springer, New York (1995)MATHGoogle Scholar
  8. 8.
    Taylor, A.D., Zwicker, W.S.: A characterization of weighted voting. Proceedings of the American mathematical society 115, 1089–1094 (1992)CrossRefMathSciNetMATHGoogle Scholar
  9. 9.
    Taylor, A.D., Zwicker, W.S.: Simple games and magic squares. Journal of combinatorial theory, ser. A 71, 67–88 (1995)CrossRefMathSciNetMATHGoogle Scholar
  10. 10.
    Taylor, A.D., Zwicker, W.S.: Simple games: desirability relations, trading, and pseudoweightings. Princeton University Press, New Jersey (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Josep Freixas
    • 1
  • Xavier Molinero
    • 2
  1. 1.Dept. de Matemàtica Aplicada 3Universitat Politècnica de Catalunya, Escola Politècnica Superior d’Enginyeria de ManresaManresaSpain
  2. 2.Dept. de Llenguatges i Sistemes InformàticsUniversitat Politècnica de Catalunya, Escola Politècnica Superior d’Enginyeria de ManresaManresaSpain

Personalised recommendations