Matching structure and bargaining outcomes in buyer–seller networks
研究了二分图（买方-卖方）网络的匹配结构与每对连接能创造的剩余份额之间的关系，发现不同谈判环境下这些份额与Gallai-Edmonds结构定理紧密相关，且该关系不依赖于特定谈判机制或交易集中度。
We examine the relationship between the matching structure of a bipartite (buyer–seller) network and the (expected) shares of the unit surplus that each connected pair in this network can create. We show that in different bargaining environments, these shares are closely related to the Gallai–Edmonds Structure Theorem. This theorem characterizes the structure of maximum matchings in an undirected graph. We show that the relationship between the (expected) shares and the Structure Theorem is not an artefact of a particular bargaining mechanism or trade centralization. However, this relationship does not necessarily generalize to non-bipartite networks or to networks with heterogeneous link values.