Cores of effectivity functions and implementation theory
In a committee where cooperative voting occurs, effectivity functions describe the blocking power of coalitions. It is a binary relation that says for each coalition T and each subset of outcomes B whether or not T can force the final outcome within B. The corresponding cooperative stability notion generalizes the familiar core of a simple game. We study those effectivity functions yielding a non-empty core for all preference profiles, of which additive effectivity functions are an example. This proves to be closely related to implementation by means of the strong equilibrium concept.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:10:y:1982:i:1:p:115-145. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.