English
Related papers

Related papers: Matching in Dynamic Imbalanced Markets

200 papers

The Kidney Exchange Problem is a prominent challenge in healthcare and economics, arising in the context of organ transplantation. It has been extensively studied in artificial intelligence and optimization. In a kidney exchange, a set of…

Data Structures and Algorithms · Computer Science 2026-05-12 Kangyi Tian , Mingyu Xiao

We study the performance of general dynamic matching models. This model is defined by a connected graph, where nodes represent the class of items and the edges the compatibilities between items. Items of different classes arrive one by one…

Computer Science and Game Theory · Computer Science 2020-09-22 Arnaud Cadas , Josu Doncel , Jean-Michel Fourneau , Ana Bušić

Designing spatial networks, such as transport networks, commonly deals with the problem of how to best connect a set of locations through a set of links. In practice, it can be crucial to order the implementation of the links in a way that…

A major problem in data augmentation is to ensure that the generated new samples cover the search space. This is a challenging problem and requires exploration for data augmentation policies to ensure their effectiveness in covering the…

Machine Learning · Computer Science 2020-10-08 Alireza Naghizadeh , Mohammadsajad Abavisani , Dimitris N. Metaxas

Many two-sided matching markets, from labor markets to school choice programs, use a clearinghouse based on the applicant-proposing deferred acceptance algorithm, which is well known to be strategy-proof for the applicants. Nonetheless, a…

Computer Science and Game Theory · Computer Science 2018-07-19 Itai Ashlagi , Yannai A. Gonczarowski

Rising provider turnover results in frequently needing to rematch patients with available providers. However, the rematching process is cumbersome for both patients and health systems, resulting in labor-intensive and ad hoc reassignments.…

Computers and Society · Computer Science 2025-06-13 Naveen Raman , Holly Wiberg

We study the greedy-based online algorithm for edge-weighted matching with (one-sided) vertex arrivals in bipartite graphs, and edge arrivals in general graphs. This algorithm was first studied more than a decade ago by Korula and P\'al for…

Data Structures and Algorithms · Computer Science 2021-12-28 Haim Kaplan , David Naori , Danny Raz

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

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

This paper studies a matching problem in which a group of agents cooperate with agents on two sides. In environments with either nontransferable or transferable utilities, we demonstrate that a stable outcome exists when cooperations…

Theoretical Economics · Economics 2025-09-16 Chao Huang

The Deferred Acceptance (DA) algorithm is an elegant procedure for finding a stable matching in two-sided matching markets. It ensures that no pair of agents prefers each other to their matched partners. In this work, we initiate the study…

Computer Science and Game Theory · Computer Science 2025-06-03 Hadi Hosseini , Grzegorz Lisowski , Shraddha Pathak

The kinetic exchange model has gained popularity in the field of statistical mechanics for investigating wealth interaction. Traditionally, kinetic exchange models have been studied without considering preferential interactions. However, in…

Physics and Society · Physics 2023-05-26 Suchismita Banerjee

In two-sided matching markets, the agents are partitioned into two sets. Each agent wishes to be matched to an agent in the other set and has a strict preference over these potential matches. A matching is stable if there are no blocking…

Computer Science and Game Theory · Computer Science 2013-02-26 Georgios Askalidis , Nicole Immorlica , Emmanouil Pountourakis

We study ex-post fairness in the object allocation problem where objects are valuable and commonly owned. A matching is fair from individual perspective if it has only inevitable envy towards agents who received most preferred objects --…

Computer Science and Game Theory · Computer Science 2022-09-09 Aleksei Y. Kondratev , Alexander S. Nesterov

Sequential fundraising in two sided online platforms enable peer to peer lending by sequentially bringing potential contributors, each of whose decisions impact other contributors in the market. However, understanding the dynamics of…

Machine Learning · Computer Science 2023-08-03 Soumajyoti Sarkar

We investigate a market without money in which agents can offer certain goods (or multiple copies of an agent-specific good) in exchange for goods of other agents. The exchange must be balanced in the sense that each agent should receive a…

Discrete Mathematics · Computer Science 2021-04-02 Pavlos Eirinakis , Ioannis Mourtos , Michalis Samaris

This paper studies the effects of altruism and spitefulness in a two-sided market in which agents behave strategically and trade according to the Shapley-Shubik mechanism. By assuming that altruistic agents have concerns for others on the…

Computer Science and Game Theory · Computer Science 2018-03-13 Michele Lombardi , Simone Tonin

A kidney exchange is a centrally-administered barter market where patients swap their willing yet incompatible donors. Modern kidney exchanges use 2-cycles, 3-cycles, and chains initiated by non-directed donors (altruists who are willing to…

Computer Science and Game Theory · Computer Science 2017-05-29 Gabriele Farina , John P. Dickerson , Tuomas Sandholm

Optical focusing through scattering media has important implications for optical applications in medicine, communications, and detection. In recent years, many wavefront shaping methods have been successfully applied to the field, among…

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
‹ Prev 1 4 5 6 7 8 10 Next ›