Purpose This study aims to provide a comprehensive analysis of two-sided matching (TSM)
research, an interdisciplinary field that integrates both theoretical and practical perspectives …

Hatfield and Milgrom [Hatfield, John William, Milgrom, Paul R., 2005. Matching with
contracts. Amer. Econ. Rev. 95, 913–935] present a unified model of matching with …

For the many-to-one matching model in which firms have substitutable and quota q−
separable preferences over subsets of workers we show that the workers-optimal stable …

We revisit the concept of fairness in the Student Placement framework. We declare an
allocation as\upalpha α-equitable if no agent can propose an alternative allocation that …

This paper considers the incentive compatibility in many-to-many two-sided matching
problems. We first show that the Blocking Lemma holds for many-to-many matchings under …

Recent years have witnessed a growing trend that offline social events are organized via
online platforms. Along this line, large efforts have been devoted to recommending …

This study analyzes the number of matches in stable and efficient matchings. The
benchmark number of matches is the largest one among the matchings in which no agent …

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 …

针对车辆在异构网络覆盖环境下的网络接入选择问题, 基于双边匹配博弈中稳定匹配的相关概念
, 提出一种车辆异构网络选择博弈模型, 通过用户侧与网络侧的双向选择得到异构网络选择的 …

This paper revisits the college admissions problem and studies the efficiency, incentive, and
monotonicity for colleges. We show that max-min criterion that is stronger than …