Voting problems with a continuum of voters and finitely many alternatives are considered. The classical Arrow and Gibbard-Satterthwaite theorems are shown to persist in this model, not for single voters but for coalitions of positive size. The emphasis of the study is on strategic considerations, relaxing the nonmanipulability requirement: are there social choice functions such that for every profile of preferences there exists a strong Nash equilibrium resulting in the alternative assigned by the social choice function? Such social choice functions are called exactly and strongly consistent. The study offers an extension of the work of Peleg (1978a) and others. Specifically, a class of anonymous social choice functions with the required property is characterized through blocking coefficients of alternatives, and associated effectivity functions are studied. Finally, representation of effectivity functions by game forms having a strong Nash Equilibrium is studied.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem in its series Discussion Paper Series with number
dp308.
Length: 39 pages Date of creation: Dec 2002 Date of revision: Publication status: Published in Social Choice and Welfare, 2006, vol. 27, pp. 477-492. Handle: RePEc:huj:dispap:dp308
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)