A new voting rule for electing committees is described. Specifically, we use approval balloting and propose a voting procedure guaranteeing that if a committee representing (in a determined proportion) all voters exists, then the selected committee has to represent all voters at least in the...

In this paper we consider convex combinations of matrices that arise in the study of distribution problems and analyse the properties of Perron's eigenvalue, and its associated positive eigenvector. We prove that the components in the (normalized) associated positive eigenvector have a monotone...

If we analyze the notion of stability (von Neumann and Morgenstern, 1944) it seems a desirable property to be fulfilled by any choice function. Paradoxically, the usual Condorcet choice functions (maximal set, top cycle, uncovered set, minimal covering, ...) are not stable in the VNM sense. In...

In 1950, Nash's seminal paper introduced the axiomatic approach to the analysis of bargaining situations. Since then, many bargaining solutions have appeared and been axiomatically analyzed. The fact that agents, when face a bargaining problem, can come up with different solution concepts (that...

We consider a cost sharing problem, where each individual is identi ed by a characteristic (a positive real number) ci: The two main positions on how to share a common cost M are the Egalitarian and the Proportional solutions. These solutions can be obtained as the Perron's eigenvectors (right...

The notion of a stable set (introduced by von Neumann and Morgenstern, 1944) is an important tool in the field of Decision Theory. Since then, some alternative definitions have appeared in the literature: the admissible set (Kalai and Schmeidler, 1977), the generalized stable set (van Deemen,...

The notion of a stable set (introduced by von Neumann and Morgenstern, 1944) is an important tool in the field of Decision Theory. However, unfortunately, the stable set has some disadvantages: it is not unique, it may select too many alternatives and, most importantly, it may fail to exist....

A minimum cost spanning tree (mcst) problem analyzes the way to effciently connect individuals to a source when they are located at different places. Once the effcient tree is obtained, the question on how allocating the total cost among the involved agents defines, in a natural way, a...

It is well known that the core of an exchange market with indivisible goods is always non empty, although it may contain Pareto inecient allocations. The strict core solves this shortcoming when indiff erences are not allowed, but when agents' preferences are weak orders the strict core may be...

This paper proposes a reform for school allocation procedures in order to help integration policies reach their objective. For this purpose, we suggest the use of a natural two-step mechanism. The (equitable) first step is introduced as an adaptation of the deferred-acceptance algorithm designed...