Let A be a self-adjoint operator acting over a space X endowed with a partition. We give lower bounds on the energy of a mixed state from its distribution in the partition and the...
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...
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
The paper introduces a framework for clustering data objects in a similarity-based context. The aim is to cluster objects into a given number of classes without imposing a hard pa...
Abstract. We present computational results concerning stable partitions in additively separable hedonic games. First, we propose a polynomial-time algorithm to compute a contractua...