Abstract In classic matching markets, individuals choose their partners and each pair chooses a contract from a finite set of feasible contracts; the existence of stable allocations then follows from the (generalized) Deferred Acceptance algorithm. We consider an extension where the contract set is a compact subset of a topological vector space (e.g., R k or ℂ [ 0 , 1 ] ) and give a simple topological argument, which leverages this classic algorithm, to establish the existence of stable allocations when payoffs are upper-semicontinuous.

中文翻译：

---

无限合约匹配市场中稳定分配的存在：一种拓扑方法

摘要 在经典匹配市场中，个人选择他们的合作伙伴，每一对从一组有限的可行合约中选择一个合约；稳定分配的存在则遵循（广义）延迟接受算法。我们考虑一个扩展，其中合约集是拓扑向量空间的紧凑子集（例如，R k 或 ℂ [ 0 , 1 ] ）并给出一个简单的拓扑参数，它利用这个经典算法来建立稳定分配的存在当收益为上半连续时。