经济
理论(学习稳定性)
数理经济学
计量经济学
计算机科学
机器学习
作者
Ravi Jagadeesan,Karolina Vocke
标识
DOI:10.1093/restud/rdae008
摘要
Abstract In matching models, pairwise-stable outcomes do not generally exist without substantial restrictions on both preferences and the topology of the network of contracts. We address the foundations of matching markets by developing a matching model with a continuum of agents that allows for arbitrary preferences and network structures. We show that pairwise-stable outcomes are guaranteed to exist. When agents can interact with multiple other counterparties, pairwise stability is too weak of a solution concept, and we argue that a refinement of it called tree stability is the most appropriate solution concept in this setting. Our main results show that tree-stable outcomes exist for arbitrary preferences and network topologies.
科研通智能强力驱动
Strongly Powered by AbleSci AI