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...

The principle of weak monotonicity for cooperative games states that if a game changes so that the worth of the grand coalition and some player's marginal contribution to all coalitions increase or stay the same, then this player's payoff should not decrease. We investigate the class of values...

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.

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...

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...

In the present paper we consider the allocation of costs in connection networks. Agents have connection demands in form of pairs of locations they want to have connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection...