Tournaments are complete and asymmetric binary relations. This type of binary relation rules out the possibility of ties or indifferences which are quite common in other contexts. In this work we generalize, from a normative point of view, some important tournament solutions to the context in...

Agents involved in a conflicting claims problem may be concerned with the proportion of their claims that is satisfied, or with the total amount they get. In order to relate both perspectives, we associate to each conflicting claims problem a bargaining-in-proportions set. Then, we obtain a...

A minimum cost spanning tree problem analyzes the way to efficiently connect agents to a source when they are located at different places. Once the efficient tree is obtained, the total cost should be allocated among the involved agents in a fair and stable manner. It is well known that there...