Search

This paper introduces and studies a class of cooperative interval games suitable to model market situations with two corners where players face interval uncertainty regarding the outcome of cooperation. In one corner there is a powerful player called the big boss; the other corner contains players that need the big boss to benefit from cooperation. Various characterizations of big boss interval games are given. The interval core of a big boss interval game is explicitly described, bi-monotonic allocation schemes using interval core elements are introduced, and it is shown that each element of the interval core of a big boss interval game is extendable to such a scheme. Two value-type interval solution concepts are defined on the class of big boss interval games which generate for each such game the same interval core allocation which is extendable to a bi-monotonic interval allocation scheme.

Uncertainty accompanies almost every situation in our lives and it influences our decisions. On many occasions uncertainty is so severe that we can only predict some upper and lower bounds for the outcome of our (collaborative) actions, i.e., payoffs lie in some intervals. Cooperative interval games have been proved useful for solving reward/cost sharing problems in situations with interval data in a cooperative environment. In this paper we propose two procedures for cooperative interval games. Both transform an interval allocation, i.e., a payoff vector whose components are compact intervals of real numbers, into a payoff vector (whose components are real numbers) when the value of the grand coalition becomes known (at once or in multiple stages). The research question addressed here is: How to determine for each player his/her/its payoff generated by cooperation within the grand coalition – in the promised range of payoffs to establish such cooperation – after the uncertainty on the payoff for the grand coalition is resolved? This question is an important one that deserves attention both in the literature and in game practice.

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 all orders on the player set, and it can be seen as a core selection based on the priority orders on the players. In both of our characterizations of the AL-value, a consistency property which we call average consistency plays an important role, and the property is obtained by the consistency property à la Davis and Maschler of the lexicographic vectors with respect to any order of players.

This paper focuses on new characterizations of convex multi-choice games using the notions of exactness and superadditivity. Furthermore, level-increase monotonic allocation schemes (limas) on the class of convex multi-choice games are introduced and studied. It turns out that each element of the Weber set of such a game is extendable to a limas, and the (total) Shapley value for multi-choice games generates a limas for each convex multi-choice game.

In this paper, we consider market situations with two corners. One corner consists of a group of powerful agents with yes-or-no choices and clan behavior. The other corner consists of non-powerful agents with multi-choices regarding the extent at which cooperation with the clan can be achieved. Multi-choice clan games arise from such market situations. The focus is on the analysis of the core of multi-choice clan games. Several characterizations of multi-choice clan games by the shape of the core are given, and the connection between the convexity of a multi-choice clan game and the stability of its core is studied.

This paper deals with the research area of cooperative interval games arising from airport situations with interval data. The major topic of the paper is to present and identify the interval Baker–Thompson rule.

This paper deals with cooperative fuzzy games arising from two economic situations: a linear production situation and a labor-time availability situation. In both economic situations we derive cooperative fuzzy games and study conditions for nonemptiness of Aubin's core. Also, relations between reasona-ble (stable) payoff schemes for the economic situations and core elements of the related cooperative fuzzy games are studied

In this paper, the egalitarian solution for convex cooperative fuzzy games is introduced. The classical Dutta–Ray algorithm for finding the constrained egalitarian solution for convex crisp games is adjusted to provide the egalitarian solution of a convex fuzzy game. For arbitrary fuzzy games, the equal division core is introduced. It turns out that both the equal division core and the egalitarian solution of a convex fuzzy game coincide with the corresponding equal division core and the constrained egalitarian solution, respectively, of the related crisp game.

In this paper we study convex games with an infinite countable set of agents and provide characterizations of this class of games. To do so, and in order to overcome some shortcomings related to the difficulty of dealing with infinite orderings, we need to use a continuity property. Infinite sequencing situations where the number of jobs is infinite countable can be related to convex cooperative TU games. It is shown that some allocations turn out to be extreme points of the core of an infinite sequencing game.