In 1972 Shapley and Shubik introduced assignment games associated to finite assignment problems in which two types of agents were involved and they proved that these games have a non-empty core. In this paper we look at the situation where the set of one type is infinite and investigate when the...

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...

The egalitarian solution for TU-games as introduced by Dutta and Ray [3] is studied. Two characterizations of the restriction of this solution to the class of convex games are given, using weak variants of the reduced game properties of Hart and Mas-Colell [6] and Davis and Maschler [5]. The...

In this paper we study the endogenous formation of cooperation structures or communication graphs between players in a superadditive TU game. For each cooperation structure that is formed, the payoffs to the players are determined by an exogenously given solution. We model the process of...

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 is related to the Kruskal algorithm for finding an mcst. Moreover, the P-value leads to a core allocation of...

Airport profit games are a generalization of airport cost games as well as of bankruptcy games. In this paper we present a simple algorithm to compute the nucleolus of airport profit games. In addition we prove that there exists an unique consistent allocation rule in airport profit problems,...

Multiglove markets and corresponding games are considered. For this class of games we introduce the notion of type monotonic allocation scheme. Allocation rules for multiglove markets based on weight systems are introduced and characterized. These allocation rules generate type monotonic...

Most of the known efficient algorithms designed to compute the nucleolus for special classes of balanced games are based on two facts: (i) in any balanced game, the coalitions which actually determine the nucleolus are essential; and (ii) all essential coalitions in any of the games in the class...

This paper studies two classes of two-person zero-sum games in which the strategies of both players are of a special type.Each strategy can be split into two parts, a taking and a guessing part.In these games two types of asymmetry between the players can occur.In the first place, the number of...