Consistent Voting Systems with a Continuum of Voters (original) (raw)

An Erratum to this article was published on 04 July 2006

Abstract

Voting problems with a continuum of voters and finitely many alternatives are considered. Since the Gibbard–Satterthwaite theorem persists in this model, we relax the non-manipulability requirement as follows: are there social choice functions (SCFs) such that for every profile of preferences there exists a strong Nash equilibrium resulting in the alternative assigned by the SCF? Such SCFs are called exactly and strongly consistent. The paper extends the work of Peleg (Econometrica 46:153–161, 1978a) and others. Specifically, a class of anonymous SCFs with the required property is characterized through blocking coefficients of alternatives and through associated effectivity functions.

Access this article

Log in via an institution

Subscribe and save

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Center for the Study of Rationality, The Hebrew University of Jerusalem, Feldman Building, Givat-Ram, 91904, Jerusalem, Israel
    B Pezaleleleg
  2. Department of Quantitative Economics, University of Maastricht, P.O. Box 616, 6200, MD, Maastricht, The Netherlands
    Hans Peters

Authors

  1. B Pezaleleleg
  2. Hans Peters

Corresponding author

Correspondence toB Pezaleleleg.

Additional information

An erratum to this article can be found at http://dx.doi.org/10.1007/s00355-006-0174-3

Rights and permissions

About this article

Cite this article

Pezaleleleg, B., Peters, H. Consistent Voting Systems with a Continuum of Voters.Soc Choice Welfare 27, 477–492 (2006). https://doi.org/10.1007/s00355-006-0140-0

Download citation

Keywords