Related papers: Consistent Conjectures in Dynamic Matching Markets
We consider a learning problem for the stable marriage model under unknown preferences for the left side of the market. We focus on the centralized case, where at each time step, an online platform matches the agents, and obtains a noisy…
In bipartite matching problems, agents on two sides of a graph want to be paired according to their preferences. The stability of a matching depends on these preferences, which in uncertain environments also reflect agents' beliefs about…
We study deviations by a group of agents in the three main types of matching markets: the house allocation, the marriage, and the roommates models. For a given instance, we call a matching $k$-stable if no other matching exists that is more…
In two-sided matching markets, ensuring both stability and strategy-proofness poses a significant challenge; it is impossible when agents' preferences are unrestricted. But what if agents' preferences have specific restricted structures?…
In stable matching, one must find a matching between two sets of agents, commonly men and women, or job applicants and job positions. Each agent has a preference ordering over who they want to be matched with. Moreover a matching is said to…
Gale and Shapley introduced a matching problem between two sets of agents where each agent on one side has an exogenous preference ordering over the agents on the other side. They defined a matching as stable if no unmatched pair can both…
In this paper, we consider the problem of choosing a set of multi-party contracts, where each coalition of agents has a non-empty finite set of contracts to choose from. We call such problems, contract choice problems. We provide conditions…
Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computational aspects of a possible similar scheme for assigning…
We study the existence of stable matchings when agents have choice correspondences instead of preference relations. We extend the framework of \cite{chambers2017choice} by weakening the path independence assumption. For many-to-many…
In this paper we analyse a dynamic model of investment under uncertainty in a duopoly, in which each firm has an option to switch from the present market to a new market. We construct a subgame perfect equilibrium in mixed strategies and…
We study dynamic decentralized two-sided matching in which players may encounter unanticipated experiences. As they become aware of these experiences, they may change their preferences over players on the other side of the market.…
We formulate and study a general time-varying multi-agent system where players repeatedly compete under incomplete information. Our work is motivated by scenarios commonly observed in online advertising and retail marketplaces, where agents…
Static stability in economic models means negative incentives for deviation from equilibrium strategies, which we expect to assure a return to equilibrium, i.e., dynamic stability, as long as agents respond to incentives. There have been…
This paper develops an integer programming approach to two-sided many-to-one matching by investigating stable integral matchings of a fictitious market where each worker is divisible. We show that stable matchings exist in a discrete…
This paper presents weakened notions of corewise stability and setwise stability for matching markets where agents have substitutable choice functions. We introduce the concepts of worker-quasi-core, firm-quasi-core, and worker-quasisetwise…
Matching algorithms have demonstrated great success in several practical applications, but they often require centralized coordination and plentiful information. In many modern online marketplaces, agents must independently seek out and…
In this paper we consider the issue of a unique prediction in one to one two sided matching markets, as defined by Gale and Shapley (1962), and we prove the following. Theorem. Let P be a one-to-one two-sided matching market and let P be…
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…
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…
Understanding the structural evolution of granular systems is a long-standing problem. A recently proposed theory for such dynamics in two dimensions predicts that steady states of very dense systems satisfy detailed-balance. We analyse…