We consider a multi-sided assignment game with the following characteristics: (a) the agents are organized in m sectors that are connected by a graph that induces a weighted m-partite graph on the set of agents, (b) a basic coalition is formed by agents from different connected sectors, and (c)...

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

This paper contributes to the program of numerical characterisation and classification of simple games outlined in the classical monograph of von Neumann and Morgenstern (1944). One of the most fundamental questions of this program is what makes a simple game a weighted majority game. The...

The effects of partially cooperating firms are examined in N-firm oligopolies. The Herfindahl-Hirschmann Index is assumed to detect the violation of the antitrust regulation by the firms, and based on this assumption a piece-wise differentiable dynamic system can be developed. The firms stop...

Using a bi-choice graph technique (Klaus and Klijn, 2009), we show that a matching for a roommate market indirectly dominates another matching if and only if no blocking pair of the former is matched in the latter (Proposition 1). Using this characterization of indirect dominance, we investigate...

This note shows that the egalitarian Dutta and Ray (1989) solution for transferable utility games is self-antidual on the class of exact partition games. By applying a careful antiduality analysis, we derive several new axiomatic characterizations. Moreover, we point out an error in earlier work...

This paper studies sequencing situations with non-linear cost functions. We show that the neighbor switching gains are now time-dependent, in contrast to the standard sequencing situations with linear cost functions, which complicate finding an optimal order and stable allocations. We derive...

In auctions with externalities, it is well-known that the core can be empty, which is undesirable both in terms of stability and fairness. Nevertheless, some auction outcome must be chosen. We separate deviations into two types: deviations by paying more and deviations by refusing to pay. In...

We study a particular class of cost sharing games - quot;data gamesquot; - covering situations where some players own data which are useful for a project pursued by the set of all players. The problem is to set up compensations between players. Data games are subadditive but generally not...

In this paper, interval-type solution concepts for interval-valued cooperative games like the interval core, the interval dominance core and stable sets are introduced and studied. The notion of I-balancedness is introduced, and it is proved that the interval core of an interval-valued...