We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
Abstract. We present computational results concerning stable partitions in additively separable hedonic games. First, we propose a polynomial-time algorithm to compute a contractua...
Privilege separation partitions a single program into two parts: a privileged program called the monitor and an unprivileged program called the slave. All trust and privileges are...
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...