In bargaining problems, a rule satisfies ordinal invariance if it does not depend on order-preserving transformations of the agents' utilities. In this paper, a simple non-cooperative game for three agents, based on bilateral offers, is presented. The ordinal Shapley rule arises in subgame...

We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity over cost and population. We also prove that the set of allocations induced by the family coincides with the irreducible core.

We present a new model for cost sharing in minimum cost spanning tree problems, so that the planner can identify the agents that merge. Under this new framework, and as opposed to the traditional model, there exist rules that satisfy merge-proofness. Besides, by strengthening this property and...

In the context of cost sharing in minimum cost spanning tree problems, we introduce a property called No Advantageous Merging. This property implies that no group of agents can be better off claiming to be a single node. We show that the sharing rule that assigns to each agent his own connection...

We study three values for transferable utility games with coalition structure, including the Owen coalitional value and two weighted versions with weights given by the size of the coalitions. We provide three axiomatic characterizations using the properties of Efficiency, Linearity, Independence...

We define a new value for games with levels structure. We introduce a new property in this class of games, balanced per capita contributions, which is related with others in the literature. We provide an axiomatic characterization of this value using this new property.

The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to share the cost among the nodes (agents). We show that this rule coincides with the folk solution, a very well-known rule of this literature.