In this paper we introduce an extension of the model of restricted communication in cooperative games as introduced in Myerson (1977) by allowing communication links to be directed and the worth of a coalition to depend on the order in which the players enter the coalition. Therefore, we model...

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions (possibly empty or consisting of a unique element) to every...

This paper studies the payoff structure of stable cooperation structures in link formation games. Players choose non-cooperatively with whom they want to form a link, and the payoffs are given by the Myerson value of the cooperation structure obtained. We characterize the class of TU-games that...

In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new...

We consider cooperative transferable utility games, or simply TU-games, with a limited communication structure in which players can cooperate if and only if they are connected in the communication graph. A difference between the restricted Banzhaf value and the Myerson value (i.e. the Shapley...

In cooperative games in which the players are partitioned into groups, we study the incentives of the members of a group to leave it and become singletons. In this context, we model a non-cooperative mechanism in which each player has to decide whether to stay in his group or to exit and act as...

The Shapley value of a cooperative transferable utility game distributes the dividendof each coalition in the game equally among its members. Given exogenous weightsfor all players, the corresponding weighted Shapley value distributes the dividendsproportionally to their weights. In this...

The variable threat-bargaining model of Nash (1953) assumes that threats in the senseof binding commitments as to what one will do if bargaining ends in conflict, are chosenbefore bargaining. By comparison, late threats to be chosen after bargaining end in conflict,appear more natural and would...

Least-Unmatched Price Auctions have become a popular format of TV and radio shows. Increasingly,they are also applied in internet trading. In these auctions the lowest single (unique)bid wins. We analyze the game-theoretic solution of least unmatched price auctions when prize,bidding cost and...