Matching Game in Bipartite Graphs

摘要

The Matching Game is a two person game, which is played on a (possibly infinite)bipartite graph (X,Y). The analysis of this game leads to some interesting results in the theory of matchings. It turns out that the first player has a winning strategy if and only if there is a matching from X to Y.