Using language game notions and the equivalence between games, this document studies John Nash’s decision of not playing the coalitional game proposed by John von Neumann. The key point is that Nash suggested hypothetical worlds that are incompatible with the kind proposed by von Neumann. And,...

Different propietats of convex and average convex games are developed in terms of unanimity coordinates. A set of necessary and sufficient conditions for the core of balanced games containing the Shapley value are given. Connections between convexity and average convexity, the Shapley value, the...

In this paper we consider the problem of the control of access to a firm's productive asset, embedding the relevant decision makers into a general structure of formal authority relations. Within such an authority structure, each decision maker acts as a principal to some decision makers, while...

We introduce the framework of parameterized collections of games with and without sidepayments and provide three nonemptiness of approximate core theorems. The parameters bound (a) the number of approximate types of players and the size of the approximation and (b) the size of nearly effective...

This paper analyses a transboundary pollution problem between two countries and studies the efficiency comparison of uniform versus differentiated abatement standards when there are imperfect transfers between countries. To achieve this goal, we use a negotiation game and the Nash bargaining...

We prove the existence of subsidy free and sustainable pricing schedule in multiproduct contestable markets. We allow firms to discriminate the local markets that are composed by a set of the products line and a set of agents. Results are obtained under an assumption of fair sharing cost and...

This paper presents a characterization of the non-emptiness of the intersection between the imputation set and the Weber set. Tools from non-cooperative zero-sum finite games are used. We assign a matrix game to any cooperative game and the sign of the value of this matrix game is used for the...

The monotonic core of a cooperative game with transferable utility (T.U.-game) is the set formed by all its Population Monotonic Allocation Schemes. In this paper we show that this set always coincides with the core of a certain game associated to the initial game.

A "law of scarcity" is that scarceness is rewarded. We demonstrate laws of scarcity for cores and approximate cores of games. Furthermore, we show that equal treatment core payout vectors satisfy a condition of cyclic monotonicity. Our results are developed for parameterized collections of games...

For two-person complete-information strategic games with transferable utility, all major variable-threat bargaining and arbitration solutions coincide. This conuence of solutions by luminaries such as Nash, Harsanyi, Rai¤a, and Selten, is more than mere coincidence. Staying in the class of...