Related papers: Concave many-to-one matching
The stable marriage problem has been introduced in order to describe a complex system where individuals attempt to optimise their own satisfaction, subject to mutually conflicting constraints. Due to the potential large applicability of…
For a many-to-one matching model, we study the matchings obtained through the restabilization of stable matchings that had been disrupted by a change in the population. We include a simple representation of the stable matching obtained in…
Stable matching in a community consisting of men and women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley, who…
Convexity, though extremely important in mathematical programming, has not drawn enough attention in the field of dynamic programming. This paper gives conditions for verifying convexity of the cost-to-go functions, and introduces an…
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…
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…
The quasi-variational inequalities play a significant role in analyzing a wide range of real-world problems. However, these problems are more complicated to solve than variational inequalities as the constraint set is based on the current…
How large ecosystems can create and maintain the remarkable biodiversity we see in nature is probably one of the biggest open questions in science, attracting attention from different fields, from Theoretical Ecology to Mathematics and…
We consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model --- in which for each…
We introduce a new class of combinatorial markets in which agents have covering constraints over resources required and are interested in delay minimization. Our market model is applicable to several settings including scheduling, cloud…
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…
This paper studies Markov perfect equilibria in a repeated duopoly model where sellers choose algorithms. An algorithm is a mapping from the competitor's price to own price. Once set, algorithms respond quickly. Customers arrive randomly…
I relate bipartite graph matchings to stable matchings. I prove a necessary and sufficient condition for the existence of a saturating stable matching, where every agent on one side is matched, for all possible preferences. I extend my…
We study two-sided many-to-one matching markets with transferable utilities, e.g., labor and rental housing markets, in which money can exchange hands between agents, subject to distributional constraints on the set of feasible allocations.…
We study the competition for partners in two-sided matching markets with heterogeneous agent preferences, with a focus on how the equilibrium outcomes depend on the connectivity in the market. We model random partially connected markets,…
The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…
Matching markets are of particular interest in computer science and economics literature as they are often used to model real-world phenomena where we aim to equitably distribute a limited amount of resources to multiple agents and…
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…
In this paper we aim to study viability and completeness in finite markets. In order to do that, we characterize the set of equivalent martingale measures of two-period markets as convex combinations of a finite number of martingale…
Min-max optimization problems (i.e., min-max games) have been attracting a great deal of attention because of their applicability to a wide range of machine learning problems. Although significant progress has been made recently, the…