2011Unpublished venueRequires access

On the Core of Dynamic Cooperative Games ∗

Ehud Lehrer, Marco Scarsini

Open publisher page 26 citations

Abstract

We consider dynamic cooperative games, where the worth of coalitions varies over time according to the history of allocations. When defining the core of a dynamic game, we allow the possibility for coalitions to deviate at any time and thereby to give rise to a new environment. When a coalition deviates, from that point on, the game is no longer played with the original set of players. The deviating coalition becomes the new grand coalition which, in turn, induces a new dynamic game. The stage games of the new dynamical game depend on all previous allocation including those that have materialized from the deviating time on. We define three types of core solutions: fair core, stable core and credible core. We characterize the first two in case where the instantaneous game depends on the last allocation (rather than on the whole history of allocations) and the third in the general case.

About this research paper

What this paper is about

We consider dynamic cooperative games, where the worth of coalitions varies over time according to the history of allocations. When defining the core of a dynamic game, we allow the possibility for coalitions to deviate at any time and thereby to give rise to a new environment. When a coalition deviates, from that point on, the game is no longer played with the original set of players. The deviating coalition becomes the new grand coalition which, in turn, induces a new dynamic game. The stage games of the new dynamical game depend on all previous allocation including those that have materialized from the deviating time on. We define three types of core solutions: fair core, stable core and credible core. We characterize the first two in case where the instantaneous game depends on the last allocation (rather than on the whole history of allocations) and the third in the general case.

Why it matters

OpenAlex reports 26 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We consider dynamic cooperative games, where the worth of coalitions varies over time according to the history of allocations. When defining the core of a dynamic game, we allow the possibility for coalitions to deviate at any time and thereby to give rise to a new environment. When a coalition deviates, from that point on, the game is no longer played with the original set of players. The deviating coalition becomes the new grand coalition which, in turn, induces a new dynamic game. The stage games of the new dynamical game depend on all previous allocation including those that have materialized from the deviating time on. We define three types of core solutions: fair core, stable core and credible core. We characterize the first two in case where the instantaneous game depends on the last allocation (rather than on the whole history of allocations) and the third in the general case.

Key concepts: Core (optical fiber), Sequential game, Mathematical economics, Set (abstract data type), Repeated game, Computer science, Point (geometry), Non-cooperative game

Related papers

Back to paper searchBrowse research topicsOriginal source
On the Core of Dynamic Cooperative Games ∗ — Research Paper | ScholarLens