We consider allocation problemswith indivisible goods when preferences are single-peaked. In this paper we identify the family of efficient, non-manipulable, consistent, and balanced solutions. We refer those solutions as Temporary Satisfaction Methods, that can be viewed as extensions to the...

This paper proposes the notion of E-stability to conciliate Pareto efficiency and fairness. We propose the use of a centralized procedure, the Exchanging Places Mechanism. It endows students a position according with the Gale and Shapley students optimal stable matching as tentative allocation...

This paper proposes a way to allocate students to schools such that conciliates Pareto efficiency and stability. Taking as a starting point the recent reform proposed by the Boston School Committee, we propose a marginal modification to reach our objective redefine how students are prioritize....

For cooperative games with transferable utilities (TU games) excess functions e : R2 ! R1 whose values e(x(S); v(S)); S N are relative negative utilities of coalitions S with respect to their payos x(S) = Pi2S xi are dened. The excess values for the class of two-person games are dened as those...