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.)
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.
If references are entirely missing, you can add them using this form.