English
Related papers

Related papers: Non-Standard Choice in Matching Markets

200 papers

We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley [GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable…

Computer Science and Game Theory · Computer Science 2026-01-14 Rohith Reddy Gangam , Tung Mai , Nitya Raju , Vijay V. Vazirani

We consider multi-item exchange markets in which agents want to receive one of their target bundles of resources. The model encompasses well-studied markets for kidney exchange, lung exchange, and multi-organ exchange. We identify a general…

Computer Science and Game Theory · Computer Science 2020-07-10 Haris Aziz

The extent to which a matching engine can cloud the modelling of underlying order submission and management processes in a financial market remains an unanswered concern with regards to market models. Here we consider a 10-variate Hawkes…

Trading and Market Microstructure · Quantitative Finance 2021-08-18 Ivan Jericevich , Patrick Chang , Tim Gebbie

Combining models in appropriate ways to achieve high performance is commonly seen in machine learning fields today. Although a large amount of combinatorial models have been created, little attention is drawn to the commons in different…

Artificial Intelligence · Computer Science 2012-01-19 Jinli Hu

We determine the quality of randomized social choice mechanisms in a setting in which the agents have metric preferences: every agent has a cost for each alternative, and these costs form a metric. We assume that these costs are unknown to…

Artificial Intelligence · Computer Science 2016-09-27 Elliot Anshelevich , John Postl

In this paper we consider stable matchings subject to assignment constraints. These are matchings that require certain assigned pairs to be included, insist that some other assigned pairs are not, and, importantly, are stable. Our main…

Theoretical Economics · Economics 2024-06-14 Gregory Gutin , Philip R. Neary , Anders Yeo

Algorithmic fairness in recommender systems requires close attention to the needs of a diverse set of stakeholders that may have competing interests. Previous work in this area has often been limited by fixed, single-objective definitions…

Information Retrieval · Computer Science 2024-10-08 Amanda Aird , Elena Štefancová , Cassidy All , Amy Voida , Martin Homola , Nicholas Mattei , Robin Burke

Algorithmic monoculture arises when many decision-makers rely on the same algorithm to evaluate applicants. An emerging body of work investigates possible harms of this kind of homogeneity, but has been limited by the challenge of…

Computer Science and Game Theory · Computer Science 2023-12-18 Kenny Peng , Nikhil Garg

The primary contribution of this paper resides in devising constant-factor approximation guarantees for revenue maximization in two-sided matching markets, under general pairwise rewards. A major distinction between our work and…

Computer Science and Game Theory · Computer Science 2024-11-26 Dan Nissim , Danny Segev , Alfredo Torrico

Recommender systems play an increasingly crucial role in shaping people's opportunities, particularly in online dating platforms. It is essential from the user's perspective to increase the probability of matching with a suitable partner…

Information Retrieval · Computer Science 2024-09-04 Yoji Tomita , Tomohiki Yokoyama

The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism design is the art of designing the rules of the game so that…

Computer Science and Game Theory · Computer Science 2007-05-23 Vincent Conitzer , Tuomas Sandholm

Sponsored search mechanisms have drawn much attention from both academic community and industry in recent years since the seminal papers of [13] and [14]. However, most of the existing literature concentrates on the mechanism design and…

Computer Science and Game Theory · Computer Science 2010-09-01 Jian Liu , Dah Ming Chiu

We introduce behavioral inequalities as a way to model dynamical systems defined by inequalities among their variables of interest. We claim that such a formulation enables the representation of safety-aware dynamical systems, systems with…

Systems and Control · Electrical Eng. & Systems 2025-04-03 Soutrik Bandyopadhyay , Debasattam Pal , Shubhendu Bhasin

LLMs are increasingly used to make or support high-stakes decisions under uncertainty, where alignment depends not only on factual accuracy but on how models weigh tradeoffs between different outcomes. We present an empirical pipeline for…

Machine Learning · Computer Science 2026-05-12 Khurram Yamin , Jingjing Tang , Eric Horvitz , Bryan Wilder

In recent years, significant advances have been made in the design and analysis of fully dynamic maximal matching algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the…

Data Structures and Algorithms · Computer Science 2020-04-21 Monika Henzinger , Shahbaz Khan , Richard Paul , Christian Schulz

We study mixing patterns in networks, meaning the propensity for nodes of different kinds to connect to one another. The phenomenon of assortative mixing, whereby nodes prefer to connect to others that are similar to themselves, has been…

Social and Information Networks · Computer Science 2019-04-24 George T. Cantwell , M. E. J. Newman

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

We develop a probabilistic consumer choice framework based on information asymmetry between consumers and firms. This framework makes it possible to study market competition of several firms by both quality and price of their products. We…

Trading and Market Microstructure · Quantitative Finance 2014-03-26 Hao Liao , Rui Xiao , Duanbing Chen , Matus Medo , Yi-Cheng Zhang

In many two-sided labor markets, interviews are conducted before matches are formed. The growing number of interviews in medical residency markets has increased demand for signaling mechanisms, where applicants send a limited number of…

Computer Science and Game Theory · Computer Science 2025-10-09 Maxwell Allman , Itai Ashlagi , Amin Saberi , Sophie H. Yu

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