Let A be a finite set of m ³ 3 alternatives, let N be a finite set of n ³ 3 players and let Rn be a profile of linear preference orderings on A of the players. Throughout most of the paper the considered voting system is the majority rule. Let uN be a profile of utility functions for RN. Using a-effectiveness we define the NTU game VuN and investigate its Aumann-Davis-Maschler and Mas-Colell bargaining sets. The first bargaining set is nonempty for m = 3 and it may be empty for m ³ 4. Moreover, in a simple probabilistic model, for fixed m, the probability that the Aumann-Davis-Maschler bargaining set is nonempty tends to one if n tends to infinity. The Mas-Colell bargaining set is nonempty for m £ 5 and it may be empty for m ³ 6. Moreover, we prove the following startling result: The Mas-Colell bargaining set of any simple majority voting game derived from the k-th replication of RN is nonempty, provided that k ³ n + 2. We also compute the NTU games which are derived from choice by plurality voting and approval voting, and we analyze some interesting examples.
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
dp376.
Find related papers by JEL classification: C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
This paper has been announced in the following NEP Reports:
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.: