English
Related papers

Related papers: Peer Effects and Stability in Matching Markets

200 papers

The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a problem has a wide variety of practical applications, ranging from…

Artificial Intelligence · Computer Science 2016-11-25 Maria Silvia Pini , Francesca Rossi , Brent Venable , Toby Walsh

The development and deployment of matching procedures that incentivize truthful preference reporting is considered one of the major successes of market design research. In this study, we test the degree to which these procedures succeed in…

Econometrics · Economics 2022-10-12 Alex Rees-Jones , Samuel Skowronek

In many centralized labor markets candidates interview with potential employers before matches are formed through a clearinghouse One prominent example is the market for medical residencies and fellowships, which in recent years has had a…

Theoretical Economics · Economics 2023-09-07 Maxwell Allman , Itai Ashlagi

Typically, fair machine learning research focuses on a single decisionmaker and assumes that the underlying population is stationary. However, many of the critical domains motivating this work are characterized by competitive marketplaces…

Computers and Society · Computer Science 2022-09-28 Jessica Dai , Sina Fazelpour , Zachary C. Lipton

In a stable matching setting, we consider a query model that allows for an interactive learning algorithm to make precisely one type of query: proposing a matching, the response to which is either that the proposed matching is stable, or a…

Computer Science and Game Theory · Computer Science 2020-09-22 Ehsan Emamjomeh-Zadeh , Yannai A. Gonczarowski , David Kempe

This paper focuses on two-sided matching where one side (a hospital or firm) is matched to the other side (a doctor or worker) so as to maximize a cardinal objective under general feasibility constraints. In a standard model, even though…

Computer Science and Game Theory · Computer Science 2019-07-10 Yasushi Kawase , Atsushi Iwasaki

In this work, we analyze the influence of a single strategic agent on the quality of the other agents' matchings in a matching market. We consider a stable matching problem with $n$ men and $n$ women when preferences are drawn uniformly…

Computer Science and Game Theory · Computer Science 2020-10-12 Ron Kupfer

Mutualistic interactions, which are beneficial for both interacting species, are recurrently present in ecosystems. Observations of natural systems showed that, if we draw mutualistic relationships as binary links between species, the…

Physics and Society · Physics 2019-08-21 Clàudia Payrató Borrás , Laura Hernández , Yamir Moreno

An approximation of strategyproofness in large, two-sided matching markets is highly evident. Through simulations, one can observe that the percentage of agents with useful deviations decreases as the market size grows. Furthermore, there…

Multiagent Systems · Computer Science 2022-11-30 Lars Lien Ankile , Kjartan Krange , Yuto Yagi

Most models of social contagion take peer exposure to be a corollary of adoption, yet in many settings, the visibility of one's adoption behavior happens through a separate decision process. In online systems, product designers can define…

Social and Information Networks · Computer Science 2013-11-13 Sean J. Taylor , Eytan Bakshy , Sinan Aral

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 Stable Roommates problems are characterized by the preferences of agents over other agents as roommates. A solution is a partition of the agents into pairs that are acceptable to each other (i.e., they are in the preference lists of…

Artificial Intelligence · Computer Science 2025-07-29 Müge Fidan , Esra Erdem

We study a many-to-one matching model inspired by school choice, where schools evaluate applicants using multiple rankings rather than a single priority order. We model each school's evaluation with social choice criteria to reflect the…

Computer Science and Game Theory · Computer Science 2026-03-05 Haoyu Song , Thanh Nguyen , Young-san Lin

Stable matching is a fundamental problem studied both in economics and computer science. The task is to find a matching between two sides of agents that have preferences over who they want to be matched with. A matching is stable if no pair…

Computer Science and Game Theory · Computer Science 2024-03-11 Juho Hirvonen , Sara Ranjbaran

We present a model that investigates preference evolution with endogenous matching. In the short run, individuals' subjective preferences influence partner selection and behavior in strategic interactions, which affect their material…

Theoretical Economics · Economics 2025-04-30 Ziwei Wang , Jiabin Wu

We highlight the tension between stability and equality in non transferable utility matching. We consider many to one matchings and refer to the two sides of the market as students and schools. The latter have aligned preferences, which in…

Theoretical Economics · Economics 2023-03-31 Alfred Galichon , Octavia Ghelfi , Marc Henry

A group of $n$ agents with numerical preferences for each other are to be assigned to the $n$ seats of a dining table. We study two natural topologies:~circular (cycle) tables and panel (path) tables. For a given seating arrangement, an…

Computer Science and Game Theory · Computer Science 2023-10-10 Damien Berriaud , Andrei Constantinescu , Roger Wattenhofer

We consider a monopolistic seller in a market that may be segmented. The surplus of each consumer in a segment depends on the price that the seller optimally charges, which depends on the set of consumers in the segment. We study which…

Theoretical Economics · Economics 2022-10-25 Nima Haghpanah , Ron Siegel

We consider two-sided matching markets, and study the incentives of agents to circumvent a centralized clearing house by signing binding contracts with one another. It is well-known that if the clearing house implements a stable match and…

Computer Science and Game Theory · Computer Science 2015-04-14 Nick Arnosti , Nicole Immorlica , Brendan Lucier

This paper studies an incentive structure for cooperation and its stability in peer-assisted services when there exist multiple content providers, using a coalition game theoretic approach. We first consider a generalized coalition…

Networking and Internet Architecture · Computer Science 2015-03-19 Jeong-woo Cho , Yung Yi
‹ Prev 1 4 5 6 7 8 10 Next ›