This paper deals with the non-emptiness of the stability set for any proper voting game.We present an upper bound on the number of alternatives which guarantees the non emptiness of this solution concept. We show that this bound is greater than or equal to the one given by Le Breton and Salles [6] for quota games.
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.
Find related papers by JEL classification: C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory D7 - Microeconomics - - Analysis of Collective Decision-Making
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.:
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.)