English
Related papers

Related papers: Random Matching Markets with Correlated Preference…

200 papers

Assume that $n = 2k$ potential roommates each have an ordered preference of the $n-1$ others. A stable matching is a perfect matching of the $n$ roommates in which no two unmatched people prefer each other to their matched partners. In…

Combinatorics · Mathematics 2026-01-13 Byron Chin , Marcus Michelen

We propose a model of two-way selection system. It appears in the processes like choosing a mate between men and women, making contracts between job hunters and recruiters, and trading between buyers and sellers. In this paper, we propose a…

General Physics · Physics 2015-02-20 Bin Zhou , Shujia Qin , Xiao-Pu Han , Zhe He , Jia-Rong Xie , Bing-Hong Wang

We study many-to-one matching problems between institutions and individuals, where each institution may be matched to multiple individuals. The matching market includes couples, who view pairs of institutions as complementary. Institutions'…

Theoretical Economics · Economics 2025-07-11 Shashwat Khare , Souvik Roy

The assignment game models a housing market where buyers and sellers are matched, and transaction prices are set so that the resulting allocation is stable. Shapley and Shubik showed that every stable allocation is necessarily built on a…

Computer Science and Game Theory · Computer Science 2026-02-23 Emile Martinez , Felipe Garrido-Lucero , Umberto Grandi

A breakthrough of Ashlagi, Kanoria, and Leshno [AKL17] found that imbalance in the number of agents on either side of a random matching market has a profound effect on the market's expected characteristics. Specifically, across all stable…

Computer Science and Game Theory · Computer Science 2021-03-12 Linda Cai , Clayton Thomas

The literature on centralized matching markets often assumes that a true preference of each player is known to herself and fixed, but empirical evidence casts doubt on its plausibility. To circumvent the problem, we consider evolutionary…

Theoretical Economics · Economics 2022-05-18 Hidemasa Ishii , Nariaki Nishino

We propose a topic modeling approach to the prediction of preferences in pairwise comparisons. We develop a new generative model for pairwise comparisons that accounts for multiple shared latent rankings that are prevalent in a population…

Machine Learning · Computer Science 2015-01-27 Weicong Ding , Prakash Ishwar , Venkatesh Saligrama

The comparison of alternative rankings of a set of items is a general and prominent task in applied statistics. Predictor variables are ranked according to magnitude of association with an outcome, prediction models rank subjects according…

This paper develops a framework for repeated matching markets. The model departs from the Gale-Shapley matching model by having a fixed set of long-lived hospitals match with a new generation of short-lived residents in every period. I show…

Theoretical Economics · Economics 2021-03-29 Ce Liu

The Stable Marriage Problem, as proposed by Gale and Shapley, considers producing a bipartite matching between two equally sized sets of boys (proposers) and respectively girls (acceptors), each member having a total preference order over…

Computer Science and Game Theory · Computer Science 2019-05-28 Mircea Digulescu

Many centralized mechanisms for two-sided matching markets that enjoy strong theoretical properties assume that the planner solicits full information on the preferences of each participating agent. In particular, they expect that…

Computer Science and Game Theory · Computer Science 2025-06-09 Yuri Faenza , Aapeli Vuorinen

Two-sided matching markets, environments in which two disjoint groups of agents seek to partner with one another, arise in several contexts. In static, centralized markets where agents know their preferences, standard algorithms can yield a…

Computer Science and Game Theory · Computer Science 2025-04-08 Vade Shah , Bryce L. Ferguson , Jason R. Marden

We model a social-encounter network where linked nodes match for reproduction in a manner depending probabilistically on each node`s attractiveness. The developed model reveals that increasing either the network`s mean degree or the…

Physics and Society · Physics 2017-06-22 S. Dipple , T. Jia , T. Caraco , G. Korniss , B. K. Szymanski

We study the stable matching problem under the random matching model where the preferences of the doctors and hospitals are sampled uniformly and independently at random. In a balanced market with $n$ doctors and $n$ hospitals, the…

Computer Science and Game Theory · Computer Science 2025-08-12 Simon Mauras , Pawel Pralat , Adrian Vetta

Human mating is a complex phenomenon. Although men and women have different preferences in mate selection, there should be compatibility in these preferences since human mating requires agreement of both parties. We investigate how…

Computers and Society · Computer Science 2016-07-27 Haluk O. Bingol , Omer Basar

We are given a bipartite graph $G = \left( A \cup B, E \right)$. In the one-sided model, every $a \in A$ (often called agents) ranks its neighbours $z \in N_{a}$ strictly, and no $b \in B$ has any preference order over its neighbours $y \in…

Computer Science and Game Theory · Computer Science 2025-10-30 Koustav De

We consider the problem of optimal recovery of true ranking of $n$ items from a randomly chosen subset of their pairwise preferences. It is well known that without any further assumption, one requires a sample size of $\Omega(n^2)$ for the…

Machine Learning · Computer Science 2019-02-13 Aadirupa Saha , Rakesh Shivanna , Chiranjib Bhattacharyya

For personalized ranking models, the well-calibrated probability of an item being preferred by a user has great practical value. While existing work shows promising results in image classification, probability calibration has not been much…

Information Retrieval · Computer Science 2022-04-27 Wonbin Kweon , SeongKu Kang , Hwanjo Yu

Two-sided matching platforms provide users with menus of match recommendations. To maximize the number of realized matches between the two sides (referred here as customers and suppliers), the platform must balance the inherent tension…

Computer Science and Game Theory · Computer Science 2020-07-29 Itai Ashlagi , Anilesh K. Krishnaswamy , Rahul Makhijani , Daniela Saban , Kirankumar Shiragur

Romantic courtship is often described as taking place in a dating market where men and women compete for mates, but the detailed structure and dynamics of dating markets have historically been difficult to quantify for lack of suitable…

Social and Information Networks · Computer Science 2018-08-20 Elizabeth E. Bruch , M. E. J. Newman
‹ Prev 1 3 4 5 6 7 10 Next ›