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

Partitioning games and games with restricted cooperation are general games which include large classes of different and important cooperative games. In this paper we combined both concepts and prove a generalization of the theorem of Quint [1991] which characterizes the core of the game by means...

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

This paper addresses a problem with an argument in Kranich, Perea, and Peters [2005] supporting their definition of the Weak Sequential Core and their characterization result. We also provide the remedy, a modification of the definition, to rescue the characterization.

We give a non-cooperative and an axiomatic characterization of the Average Lexicographic value (AL-value) on the class of balanced games. The AL-value is a single-valued solution for balanced TU-games. It is defined as the average of lexicographic maximum of the core of the game with respect to...

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

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

Strategic behaviors of players depend crucially on the coalition structures of a game. A recursive sequence identifying the number of embedded coalitions in a n-player game is derived. The paper also derives a recursive sequence identifying the number of embedded coalitions in a n-player game...

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