We consider an analytic formulation/parametrization of the class of efficient, linear, and symmetric values for TU games that, in contrast to previous approaches, which rely on the standard basis, rests on the linear representation of TU games by unanimity games. Unlike most of the other...

We provide new characterizations of the equal surplus division value and the equal division value as well as of the class of their convex mixtures. This way, the difference between the Shapley value, the equal division value, and the equal surplus division value is pinpointed to one axiom....

A group of agents are waiting for their job to be processed in a facility. We assume that each agent needs the same amount of processing time and incurs waiting costs. The facility has two parallel servers, being able to serve two agents at a time. We are interested in finding the order to serve...

Agents participating in different kind of organizations, usually take different positions in some network structure. Two well-known network structures are hierarchies and communication networks. We give an overview of the most common models of communication and hierarchy restrictions in...

In a liability problem, the asset value of an insolvent firm must be distributed among the creditors and the firm itself, when the firm has some freedom in negotiating with the creditors. We model the negotiations using cooperative game theory and analyze the Shapley value to resolve such...

We characterize the equal division value, the equal surplus division value, and the class of their affine combinations for TU-games involving equal loss under separatorization. This axiom requires that, if a player becomes a dummifying player (Casajus and Huettner, in Economics Letters 122(2):...

A situation in which a finite set of players can generate certain payoffs by cooperation can be described by a cooperative game with transferable utility. A solution for TU-games assigns to every TU-game a distribution of the payoffs that can be earned over the individual players. Two well-known...

We suppose that players in a cooperative game are located within a graph structure, such as a social network or supply route, that limits coalition formation to coalitions along connected subsets within the graph. This in turn leads to a more general study of coalitional games in which there are...