Three solution concepts for cooperative games with random payoffs are introduced. These are the marginal value, the dividend value and the selector value. Inspiration for their definitions comes from several equivalent formulations of the Shapley value for cooperative TU games. An example shows...

In congestion games, players use facilities from a common pool. The benefit that a player derives from using a facility depends, possibly among other things, on the number of users of this facility. The paper gives an easy alternative proof of the isomorphism between exact potential games and...

A class of non cooperative games characterized by a "congestion effect" is studied, in which there exists a strong Nash equilibrium, and the set of Nash equilibria, the set of strong Nash equilibria and the set of strategy profiles maximizing the potential function coincide. The structure of the...

Cooperative aspects of multiple criteria decision making with respect to cost allocation in a network will be studied. The vector valued costs of a graph that connects a group of geographically scattered users to a common source have to be distributed among the users. Here a specific class of...

We provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. As it turns out, a cooperative game is convex if and only if all its marginal games are superadditive, and a monotonic game satisfying the veto player property with...

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each...