Iterated Majority Voting

  • Stéphane Airiau
  • Ulle Endriss
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5783)


We study a model in which a group of agents make a sequence of collective decisions on whether to remain in the current state of the system or switch to an alternative state, as proposed by one of them. Examples for instantiations of this model include the step-wise refinement of a bill of law by means of amendments to be voted on, as well as resource allocation problems, where agents successively alter the current allocation by means of a sequence of deals. We specifically focus on cases where the majority rule is used to make each of the collective decisions, as well as variations of the majority rule where different quotas need to be met to get a proposal accepted. In addition, we allow for cases in which the same proposal may be made more than once. As this can lead to infinite sequences, we investigate the effects of introducing a deadline bounding the number of proposals that can be made. We use both analytical and experimental means to characterise situations in which we can expect to see a convergence effect, in the sense that the expected payoff of each agent will become independent from the initial state of the system, as long as the deadline is chosen large enough.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Rosenschein, J.S., Zlotkin, G.: Rules of Encounter. MIT Press, Cambridge (1994)Google Scholar
  2. 2.
    Endriss, U., Maudet, N., Sadri, F., Toni, F.: Negotiating socially optimal allocations of resources. Journal of Artif. Intell. Res. 25, 315–348 (2006)MATHMathSciNetGoogle Scholar
  3. 3.
    Lang, J., Xia, L.: Sequential composition of voting rules in multi-issue domains. Mathematical Social Sciences 57(3), 304–324 (2009)CrossRefMathSciNetGoogle Scholar
  4. 4.
    May, K.O.: A set of independent necessary and sufficient conditions for simple majority decisions. Econometrica 20, 680–684 (1952)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Sen, A.K.: Collective Choice and Social Welfare. Holden-Day (1970)Google Scholar
  6. 6.
    Grinstead, C.M., Snell, J.L.: Introduction to Probability, 2nd edn. American Mathematical Society (1997)Google Scholar
  7. 7.
    Laslier, J.F.: Tournament Solutions and Majority Voting. Springer, Heidelberg (1997)MATHGoogle Scholar
  8. 8.
    Baron, D.P.: A dynamic theory of collective goods programs. The American Politicial Science Review 90, 316–330 (1996)CrossRefGoogle Scholar
  9. 9.
    Penn, E.M.: A model of farsighted voting. American Journal of Political Science 53, 36–54 (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Stéphane Airiau
    • 1
  • Ulle Endriss
    • 1
  1. 1.Institute for Logic, Language and ComputationUniversity of Amsterdam 

Personalised recommendations