Absorbing Sets in Coalitional Systems

The purpose of this paper is twofold: First, to present an approach and a solution for analyzing the stability of coalition structures: We define a coalitional system (a set and a binary relation on that set) that explains the transitions between coalition structures and we propose to solve these systems using the absorbing sets solution for abstract systems. Second, to perform an analysis of this approach to evidence its utility in determining the stable coalition structures for some socioeconomic problems. We find that the absorbing sets solution efficiently solves this class of coalitional systems.coalition structures, coalitional systems, absorbing sets solution

Internal Organization of Firms and Cartel Formation

We introduce and characterize a new solution concept for TU games. The new soluction is called SD-prenucleolus and is a lexicographic value although is not a weighted prenucleolus. The SD-prenucleolus satisfies several desirable poperties and is the only known solution that satisfies core stability, strong aggegate monotonicity and null player out property in the class of balanced games. The SD-prenucleolus is the only known solution that satisfies core stability continuity and is monotonic in the class of veto balanced games.absorbing sets solution, cartels, stability, strategic delegation

Absorbing Sets in Coalitional Systems

The purpose of this paper is twofold: First, to present an approach and a solution for analyzing the stability of coalition structures: We define a coalitional system (a set and a binary relation on that set) that explains the transitions between coalition structures and we propose to solve these systems using the absorbing sets solution for abstract systems. Second, to perform an analysis of this approach to evidence its utility in determining the stable coalition structures for some socioeconomic problems. We find that the absorbing sets solution efficiently solves this class of coalitional systems.Financial support from University of the Basque Country projects: UPV-036.321-HA116/98, UPV-036.321-HA042/99, UPV-00031.321-HA7903/2000, Basque Government project: GV PI-1998-68 and Ministerio de Educación y Ciencia (Government of Spain) project: BEC2000-0875 is gratefully acknowledged

Quasidiagonality of nuclear C*-algebras

We prove that faithful traces on separable and nuclear C*- algebras in the UCT class are quasidiagonal. This has a number of consequences. Firstly, by results of many hands, the classification of unital, separable, simple and nuclear C*-algebras of finite nuclear dimension which satisfy the UCT is now complete. Secondly, our result links the finite to the general version of the Toms-Winter conjecture in the expected way and hence clarifies the relation between decomposition rank and nuclear dimension. Finally, we confirm the Rosenberg conjecture: discrete, amenable groups have quasidiagonal C*-algebras

A note on extended stable sets

Contains fulltext : 160073pub.pdf (publisher's version ) (Open Access)We study abstract decision problems by introducing an extended dominance relation with respect to a set of alternatives. This extension is in between the traditional dominance relation as formulated by Von Neumann and Morgenstern (Theory of games and economic behavior, Princeton University Press, Princeton, 1944) and the transitive closure of it. Subsequently, stable sets are defined and studied for this extended relation. We formulate a characterization of stable sets for this relation and an existence theorem. Finally, we discuss its relation with Von Neumann–Morgenstern stable sets and generalized stable sets.12 april 201