Simple games are abstract representations of voting systems and other group-decision procedures. A stable set—or von Neumann-Morgenstern solution—of a simple game represents a “standard of behavior” that satisfies certain internal and external stability properties. Compound simple games...

There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...

Solymosi and Raghavan (2001) characterize the stability of the core of the assignment game by means of a property of the valuation matrix. They show that the core of an assignment game is a von Neumann-Morgenstern stable set if and only if its valuation matrix has a dominant diagonal. Their...

We show that the characterization result of the weak core correspondence in simple games in Takamiya et al. (2018) still holds true even when the set of alternatives contains uncountably infinite elements

The aim of the paper is carrying out of survey for cooperation among banking supervisors based on the model of cooperative games. The initial measures of supervisors are aimed at rescuing the banking assets in their territory and to reduce losses to local taxpayers. The new reality demands these...

In this paper, we introduce a solution concept generalizing the Harsanyi non-transferable utility (NTU) value to cooperative games with incomplete information. The so-defined S-solution is characterized by virtual utility scales that extend the Harsanyi-Shapley fictitious weighted utility...

The value is a solution concept for n-person strategic games, developed by Nash, Shapley, and Harsanyi. The value provides an a priori evaluation of the economic worth of the position of each player, reflecting the players' strategic possibilities, including their ability to make threats against...

This chapter studies the theory of value of games with infinitely many players.Games with infinitely many players are models of interactions with many players. Often most of the players are individually insignificant, and are effective in the game only via coalitions. At the same time there may...

This paper surveys some applications of cooperative game theory to supply chain management. Special emphasis is placed on two important aspects of cooperative games: profit allocation and stability. The paper first describes the construction of the set of feasible outcomes in commonly seen...

This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output. Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic...