We present a fascinating model that has lately caught attention among physicists working in
complexity related fields. Though it originated from mathematics and later from economics …

The deferred acceptance algorithm proposed by Gale and Shapley (1962) has had a
profound influence on market design, both directly, by being adapted into practical matching …

We study many-to-one matchings, such as the assignment of students to colleges, where the
students have preferences over the other students who would attend the same college. It is …

Motivated by applications in online dating and kidney exchange, we study a stochastic
matching problem in which we have a random graph G given by a node set V and …

This paper considers a decentralized process in many-to-many matching problems. We
show that if agents on one side of the market have substitutable preferences and those on …

Smart city enhances the intelligence and sustainability of the city assets through advanced
and diversified applications characterised by specific Quality of Service requirements. To …

Matching theory studies how agents and/or objects from different sets can be matched with
each other while taking agents' preferences into account. The theory originated in 1962 with …

This paper examines imperfect matching between venture capital (VC) firms and
entrepreneurial firms in the VC market. We find an anomaly of imperfect matching evidenced …

We investigate the uniqueness of stable coalition structures in a simple coalition formation
model, for which specific coalition formation games, such as the marriage and roommate …

I introduce a class of algorithms called Deferred Acceptance with Compensation Chains
(DACC). DACC algorithms generalize the DA algorithms by Gale and Shapley [1962] by …