A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the...

In a dynamic model of assignment problems, small deviations suffice to move between stable outcomes. This result is used to obtain no-selection and almost-no-selection results under the stochastic stability concept for uniform and payoff-dependent errors. There is no-selection of partner or...

In this note we consider the cooperative linear quadratic control problem. That is, the problem where a number of players, all facing a (different) linear quadratic control problem, decide to cooperate in order to optimize their performance.It is well-known, in case the performance criteria are...

In this article we derive necessary and sufficient conditions for the existence of Pareto optimal solutions for an N player cooperative infinite horizon differential game. Firstly, we write the problem of finding Pareto candidates as solving N constrained optimal control subproblems. We derive...

The main objects here are Nash equilibria in spatial Cournot oligopolies when profits depend on coordinated distribution. Production is non-cooperative, but the subsequent transportation must be performed jointly to minimize costs. Cournot-Nash equilibria for this two-stage game with partial...

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the...

In this note we present as well necessary as sufficient conditions for existence of a Pareto optimum for general non-convex differential games. The obtained results are used to analyze the non-convex regular indefinite linear quadratic differential game. For the scalar case an algorithm is...

We study fundamental properties of monotone network enterprises which contain public vertices and have positive and negative costs on edges and vertices. Among the properties studied are the nonemptiness of the core, characterization of nonredundant core constraints, ease of computation of the...