Microgrids are defined as an area of electricity distribution network that can operate autonomously from the rest of the network. In order to achieve the best economic outcomes, the participants in a microgrid can benefit from cooperation in microgrid design and operation. In this paper, a...

We model cooperative games when externality affects the payoffs of coalitions. The coalitional games among countries committing to pollution reduction can be easily embedded into such a framework. We evaluate the individual welfare for countries joining the International Environmental Agreements...

The core of games arising from semi-infinite transportation situations with infinitely divisible goods is studied. In these situations one aims at maximizing the profit from transporting a good from a finite number of suppliers to an infinite number of demanders. This good is infinitely...

Games corresponding to semi-infinite transportation and related assignment situations are studied. In a semi-infinite transportation situation, one aims at maximizing the profit from the transportation of a certain good from a finite number of suppliers to an infinite number of demanders. An...

We study linear production situations with an infinite number of production techniques. Such a situation gives rise to a semi-infinite linear program. Related to this program, we introduce primal and dual games and study relations between these games, the cores of these games and the so-called...

This paper studies the pros and cons of a monetary union for the ASEAN1 countries, excluding Myanmar. We estimate a stylized open-economy dynamic general equilibrium model for the ASEAN countries. Using the framework of linear quadratic differential games, we contrast the potential gains or...

In this paper we study an extension of the linear production game (LPG) introduced by Owen (1975). We discuss LPG with players who have flexible resources. Here, flexibility means that a player has a universal resource (e.g. working time) which he can split up (e.g. to execute different tasks)....

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision. -- Fair Division ; Maxmin Allocation ; Kalai...

We show the existence of an upper bound for the number of blocks required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the TU game considered. For the class of games with non-empty cores this means that the core can...