Matching markets are of particular interest in computer science and economics literature as they are often used to model real-world phenomena where we aim to equitably distribute a limited amount of resources to multiple agents and determine these distributions efficiently. Although it has been shown that finding market clearing prices for Fisher markets with indivisible goods is NP-hard, there exist polynomial-time algorithms able to compute these prices and allocations when the goods are divisible and the utility functions are linear. We provide a promising research direction toward the development of a market that simulates buyers' preferences that vary according to the bundles of goods allocated to other buyers. Our research aims to elucidate unique ways in which the theory of matching markets can be extended to account for more complex and often counterintuitive microeconomic phenomena.
翻译:相匹配的市场对计算机科学和经济学文献特别感兴趣,因为它们常常被用来模拟现实世界现象,我们力求向多个代理商公平分配有限数量的资源,并有效地确定这些分布。虽然已经表明为具有不可分割货物的渔业市场寻找清市价格是坚硬的NP,但在货物可分化和实用功能为线性时,存在着能够计算这些价格和分配的多种时间算法。我们为开发一个市场提供了一个有希望的研究方向,这个市场可以模拟买方的偏好,这种偏好根据分配给其他买家的货物的包包件而有所不同。我们的研究旨在阐明各种独特的方法,使匹配市场的理论得以扩展,以顾及更为复杂而且往往反直觉的微观经济现象。