In many share problems there is an a priori given a natural set of possible divisions to solve the sharing problem. Cooperative games related to such share sets are introduced, which may be helpful in solving share problems. Relations between properties of share sets and properties of games are...

The fertile application of cooperative game techniques to cost sharing problems on networks has so far concentrated on the Stand Alone core test of fairness and/or stability, and ignored many combinatorial optimization problems where this core can be empty. I submit there is much room for an...

In this paper, we deal with situations arising from markets where an Internet search service provider offers a service of listing firms in decreasing order according to what they have bid. We call these ranking auction situations and introduce the corresponding TU-games. The core, as well as the...

In this paper, we explain why the field of cost allocation problems with a coalition structure is a wide and promising unexplored research direction. In particular, we pose some open questions for airport games with a coalition structure.

The problem of comparing TU-cooperative game values is introduced and analyzed. The proposed method is based on multicriteria methodology and the ASPID (Analysis and Synthesis of Parameters under Information Deficiency) technique (Hovanov and Kolary (1998)). The Shapley value and the nucleolus...

This paper introduces a new model concerning cooperative situations in which the payoffs are modeled by random variables. We analyze these situations by means of cooperative games with random payoffs. Special attention is paid to three types of convexity, namely coalitional-merge,...

The pre-nucleolus is a popular egalitarian solution concept for cost-sharing games. A drawback of this concept is that an associated cost allocation often cannot be calculated in polynomial time. Therefore, it would be convenient to know whether the pre-nucleolus of a particular game coincides...

Recently it is proved that all infinite assignment games have a non-empty core. Using this fact, and a technique suggested by L. S. Shapley for finite permutation games, we prove similar results for infinite permutation games. Infinite transportation games can be interpreted as a generalization...

This paper is concerned with the question of how to define the core when cooperation takes place in a dynamic setting. The focus is on dynamic cooperative games in which the players face a finite sequence of exogenously specified TU-games. Three different core concepts are presented: the...

In this paper we propose an extension of the core of NTU games from its domain to a larger set of games satisfying a few conditions of well-behavedness. The solution concept is a rather straightforward generalization of the extended core of TU games introduced by Gomez [2003] and is shown to...