<Para ID="Par1">The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal … their minimum right. A game is called compromise stable if the core is equal to the core cover, i.e. the core is the convex … hull of the larginal vectors. This paper analyzes the structure of orderings corresponding to larginal vectors of the core …

corresponding sequencing game is defined followed by an analysis of a context-specific rule that leads to core elements of this game …

through the core of a capacity that is explicitly derived within our framework. Our result in this paper also derives Gilboa …

the literature are various conditions of robustness to blocking coalitions with respect to agentsʼ ex ante (individual … strengthens the existing ones. An allocation is reclaim-proof if it is robust to blocking coalitions with respect to any …

of preference profiles into subsets with the property that all preference profiles in the same subset have the same Core … generate as strict extensions all the (complete) preference profiles with the same Core. This is important for applications … since it reduces the amount of information that agents have to reveal about their preference relations to centralized Core …

In this paper, we study inventory pooling coalitions within a decentralized distribution system consisting of a …

precedence constraints. Replacing the inequalities that define the core by equations for a collection of coalitions results in a … face of the core. A collection of coalitions is called normal if its resulting face is bounded. The bounded core is the …A game with precedence constraints is a TU game with restricted cooperation, where the set of feasible coalitions is a …