Abstract

Decomposable effectivity functions are introduced as an extension of additive effectivity functions. Whereas additive effectivity functions are determined by pairs of additive TU-games, decomposable effectivity functions are generated by pairs of TU-games that need not be additive. It turns out that the class of decomposable effectivity functions does not only contain the class of additive effectivity functions but it also contains the class of effectivity functions corresponding to simple games and the class of effectivity functions corresponding to veto functions. We examine relations between properties of decomposable effectivity functions and the TU-games by which they are generated. It turns out that a decomposable effectivity function is stable whenever it can be generated by a pair of balanced TU-utility games. Finally, we provide two characterizations of decomposable effectivity functions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.