scispace - formally typeset
Book ChapterDOI

Cores and Stable Blockings

TLDR
In this article, the authors investigate stable blocking relations, i.e., those outcomes which are rejected by no coalition of agents, and show that the existence of such outcomes depends only on the stability of the blocking generated by a given mechanism.
Abstract
This chapter is devoted to the issue of stable outcomes, that is those outcomes which are rejected by no coalition of agents. The existence of such outcomes depends only on the stability of the blocking generated by a given mechanism. We investigate here stable blocking relations. We begin with a few examples and give some useful instruments (Section 4.1). In Sections 4.2–4.4 we discuss three classes of stable blockings: additive blockings, almost additive blockings, and convex blockings. The main finding is that for almost additive blockings a family of coalitions which reject alternatives out of the core, can be equipped with a laminar structure (Theorem (4.4.7)). Section 4.5 reviews a series of necessary conditions to warrant the stability of a given blocking. In particular, convexity and almost-additivity turn out to be necessary for the stability of maximal blockings. In Section 4.6, we develop a veto-procedure in order to find elements in the core. The procedure yields single-element outcomes for any maximal convex blocking.

read more

References
More filters
Journal ArticleDOI

The vetoers in a simple game with ordinal preferences

TL;DR: In this paper, a core of a simple game with ordinal preferences on a set of alternative outcomes is considered and necessary and sufficient conditions for such games to have a nonempty core are given.
Journal ArticleDOI

Cores of effectivity functions and implementation theory

TL;DR: In a committee where cooperative voting occurs, effectivity functions describe the blocking power of coalitions as mentioned in this paper, 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.
Journal ArticleDOI

A note on the extension of an order on a set to the power set

TL;DR: In this paper, it was shown that the combination of Gardenfors' principle of extension with a very mild monotonicity requirement leads to an impossibility result, and the problem of extending an order on a set to the power set was shown to be NP-hard.