Three solution concepts for cooperative games with random payoffs are introduced. These are the marginal value, the dividend value and the selector value. Inspiration for their definitions comes from several equivalent formulations of the Shapley value for cooperative TU games. An example shows that these solutionscan all be different for cooperative games with random payoffs. Properties are st...

This is a brief survey describing some of the recent progress and open problems in the area of cooperative games with incomplete information. We discuss exchange economies, cooperative Bayesian games with orthogonal coalitions, and issues of cooperation in non-cooperative Bayesian games.

This is a brief survey describing some of the recent progress and open problems in the area of cooperative games with incomplete information. We discuss exchange economies, cooperative Bayesian games with orthogonal coalitions, and issues of cooperation in non-cooperative Bayesian games.

1. Definitions 2 1.1. Non-cooperative Games 2 1.2. Cooperative 2-person Games 4 1.3. Cooperative n-person Games (in coalitional form) 6 2. Theorems and Main Ideas 7 3. Techniques 8 3.1. Tips to remember when solving 2-player 0-sum games: 8 3.2. Solving for mixed strategies in 2-player 0-sum games: 8 3.3. Finding equilibrium pairs in 2-person nonzero-sum games 9 3.4. Finding the Nash maximin bar...

This paper explores a PAC (probably approximately correct) learning model in cooperative games. Specifically, we are given m random samples of coalitions and their values, taken from some unknown cooperative game; can we predict the values of unseen coalitions? We study the PAC learnability of several well-known classes of cooperative games, such as network flow games, threshold task games, and...

In this note we make a comparison between the class of monotonic TU cooperative games and the class of superadditive TU cooperative games. We first provide the equivalence between a weakening of the class of superadditive TU games and zero-monotonic TU games. Then, we show that zero-monotonic TU games and monotonic TU games are different classes. Finally, we show under which restrictions the cl...

Cooperative games provide an appropriate framework for fair and stable profit distribution in multiagent systems. In this paper, we study the algorithmic issues on path cooperative games that arise from the situations where some commodity flows through a network. In these games, a coalition of edges or vertices is successful if it enables a path from the source to the sink in the network, and l...

In cooperative dynamic games a stringent condition – that of subgame consistency – is required for a dynamically stable cooperative solution. In particular, a cooperative solution is subgame consistent if an extension of the solution policy to a subgame starting at a later time with a state brought about by prior optimal behavior would remain optimal. This paper extends subgame consistent solut...

We introduce a new class of cooperative games by using the notion of local supermodularity. Therefore locally convex games can be considered as relaxations of convex games. Cooperative games with the unit marginal worth property are defined and characterizations of locally concave (convex) games with this property are proved. Moreover, we obtain a characterization of a subclass of locally conca...

Cooperative games on antimatroids are cooperative games restricted by a combinatorial structure which generalize the permission structure. So, cooperative games on antimatroids group several well-known families of games which have important applications in economics and politics. Therefore, the study of the rectricted games by antimatroids allows to unify criteria of various lines of research. ...