We explore in this paper the axiomatic approach to the problem of sharing the revenue from bundled pricing. We formalize two models for this problem on the grounds of two different informational bases. In both models, we provide axiomatic rationale for natural rules to solve the problem. We,...

We characterize a rule in minimum cost spanning tree problems using an additivity property and some basic properties. If the set of possible agents has at least three agents, these basic properties are symmetry and separability. If the set of possible agents has two agents, we must add positivity.

We define the canonical form of a cost spanning tree problem. The canonical form has the property that reducing the cost of any arc, the minimal cost of connecting agents to the source is also reduced. We argue that the canonical form is a relevant concept in this kind of problems and study a...

In this paper we study the restriction, to the class of bargaining problems with coalition structure, of several values which have been proposed on the class of non-transferable utility games with coalition structure. We prove that all of them coincide with the solution independently studied in...

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.

The division problem under constraints consists of allocating a given amount of an homogeneous and perfectly divisible good among a subset of agents with single-peaked preferences on an exogenously given interval of feasible allotments. We characterize axiomatically the family of extended...

We associate to each cost spanning tree problem a non-cooperative game, which is inspired by a real-life problem. We study the Nash equilibria and subgame perfect Nash equilibria of this game. We prove that these equilibria are closely related with situations where agents connect sequentially to...

We introduce a compromise value for non-transferable utility games: the Chi-compromise value. It is closely related to the Compromise value introduced by Borm, Keiding, McLean, Oortwijn, and Tijs (1992), to the MC-value introduced by Otten, Borm, Peleg, and Tijs (1998), and to the Ω-value...

We study coalitional values for games in generalized characteristic function form. There are two extensions of the Shapley value (Shapley (1953)) in this context, one introduced by Nowak and Radzik (1994) and the other introduced by us. We generalize both values to games with a priori unions in...

We study how to partition a set of agents in a stable way when each coalition in the partition has to share a unit of a perfectly divisible good, and each agent has symmetric single-peaked preferences on the unit interval of his potential shares. A rule on the set of preference profiles consists...