In this paper we consider one-to-many matching problems where the preferences of the agents involved are represented by monetary reward functions. We characterize Pareto optimal matchings by means of contractually exchange stability and matchings of maximum total reward by means of compensation...

This paper studies the relation between optimal dam capacity and water management under rivalry uses and externalities. We extend the hydropower generation model, based on Haddad (2011), by including the competing use of water resource, non-linear building cost of dam capacity and externalities...

This discussion paper led to a publication in 'TOP' (forthcoming).<P> In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game....</p>

A situation in which a finite set of agents can generate certain payoffs by cooperation can be described by a cooperative game with transferable utility (or simply a TU-game) where each agent is represented by one player in the game. In this paper, we assume that one agent can be represented by...

This discussion paper resulted in a publication in 'Mathematical Methods of Operations Research', 2013, 77, 1-14.<P> In this paper we provide new axiomatizations of the Shapley value for TU-games using axioms that are based on relational aspects in the interactions among players. Some of these...</p>

We introduce the prediction value (PV) as a measure of players’ informational importance in probabilistic TU games. The latter combine a standard TU game and a probability distribution over the set of coalitions. Player i’s prediction value equals the difference between the conditional...

We consider a cooperative game with a bipartition that indicates which players are participating. This paper provides an analytical solution for the Shapley value when the worth of a coalition only depends on the number of participating coalition players. The computational complexity grows...