In this note we provide a strategic implementation of the Average Tree solution for zero-monotonic cycle-free graph games. That is, we propose a non-cooperative mechanism of which the unique subgame perfect equilibrium payoffs correspond to the average hierarchical outcome of the game. This...

An evolutionary style model of recontracting is given which guarantees convergence to core allocations of an underlying cooperative game. Unlike its predecessors in the evolution/learning literature, this is achieved without assumptions of convexity of the characteristic function or a reliance...

In an exchange economy with incomplete information, the signaling core is defined by the set of state-contingent allocations to which no coalitions object under informational leakage through proposals by informed agents. An objection underlying the signaling core is supported by a sequential...

Complementary to the axiomatic and mechanism design studies on queueing problems, this paper proposes a strategic bargaining approach to resolve queueing conflicts. Given a situation where players with different waiting costs have to form a queue in order to be served, they firstly compete with...

We study a model where a central player (the principal) bargains bilaterally with each of several players (the agents) to create and share the surplus of a coalitional game. It is known that, if the payments that were previously agreed (with each of the remaining agents) are renegotiated in case...

This paper provides a flexible strategic framework to analyze bargaining and values in environments with coalitional externalities. Within this framework we propose a new value that extends the Shapley value to partition function form games, the so-called Rational Belief Shapley (RBS) value. We...

This study considers waiting times for populations to achieve efficient social coordination. Belloc and Bowles [1] conjecture that coalitional behavior will hasten such coordination. This turns out to be true when every member of the population interacts with every other member, but does not...

This paper considers marriage problems, roommate problems with nonempty core, and college admissions problems with responsive preferences. All stochastically stable matchings are shown to be contained in the set of matchings which are most robust to one-shot deviation.

The existence of von Neumann–Morgenstern solutions (stable sets) for assignment games has been an unsolved question since Shapley and Shubik (1972) [11]. For each optimal matching between buyers and sellers, Shubik (1984) [12] proposed considering the union of the core of the game and the core...

We study allocation rules that are robust to coalitional manipulation by transferring, merging, or splitting individual characteristics among coalition partners (e.g. merging or splitting claims in bankruptcy problems). Coalition formation is restricted by an exogenous network (a non-directed...