Handbook of the Shapley Value contains 24 chapters and a foreword written by Alvin E.
Roth, who was awarded the Nobel Memorial Prize in Economic Sciences jointly with Lloyd …

Minimum-cost spanning tree problems are well-known problems in the operations research
literature. Some agents, located at different geographical places, want a service provided by …

We explore the implications of the principle of monotonicity in the problem of sharing the
revenues from broadcasting sports leagues. We formalize different forms of this principle as …

Several authors recently proposed an elegant construction to divide the minimal cost of
connecting a given set of users to a source. This folk solution applies the Shapley value to …

Minimum cost spanning tree (mcst) problems try to connect agents efficiently to a source
when agents are located at different points in space and the cost of using an edge is fixed …

The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to
solve the cost sharing problem in minimum cost spanning tree (mcst) situations. The P-value …

This paper deals with cost allocation problems arising from connection situations where
edge costs are closed intervals of real numbers. To solve such problems, we extend to the …

We consider a communication network where each pair of users requests a connection
guaranteeing a certain capacity. The cost of building capacity is identical across pairs …

Abstract In Tijs et al.(Eur J Oper Res 175: 121–134, 2006) a new family of cost allocation
rules is introduced in the context of cost spanning tree problems. In this paper we provide …

In this paper we consider the minimum cost spanning tree model. We assume that a central
planner aims at implementing a minimum cost spanning tree not knowing the true link costs …