Assortative Matching with Externalities and Farsighted Agents(by Kenzo Imamura, Hideo Konishi)


Kenzo Imamura, Hideo Konishi


We consider a one-to-one assortative matching problem in which matched pairs compete for a prize. With such externalities, the standard solution concept, pairwise stable matching, may not exist. In this paper, we consider farsighted agents and analyze the largest consistent set (LCS) of Chwe (1994). Despite the assortative structure of the problem, LCS tend to be large with the standard effectiveness functions: LCS can be the set of all matchings, including an empty matching with no matched pair. By modifying the effectiveness function motivated by Knuth (1976), LCS becomes a singleton of the positive assortative matching. Our results suggest that the choice of effectiveness function can significantly impact the solution in a matching problem with externalities.