The Core of the Matching Game

Abstract

In the matching game there are two sets of players P and Q and for each pair (p, q) there is a set of payoffs (upI vq) which can be obtained if the players p and q decide to collaborate. We give a constructive proof that the core of this game is nonempty and show that it has a strong connectedness property which may be thought of as a nonlinear… (More)

Topics

1 Figure or Table

Slides referencing similar topics