Related papers: Stable Outcomes for Two-Sided Contract Choice Prob…
The stable allocation problem is a many-to-many generalization of the well-known stable marriage problem, where we seek a bipartite assignment between, say, jobs (of varying sizes) and machines (of varying capacities) that is "stable" based…
The classic two-sided many-to-one job matching model assumes that firms treat workers as substitutes and workers ignore colleagues when choosing where to work. Relaxing these assumptions may lead to nonexistence of stable matchings.…
Gale and Shapley's stable assignment problem has been extensively studied, applied, and extended. In the context of school choice, mechanisms often aim at finding an assignment that is more favorable to students. We investigate two…
We study the classical, two-sided stable marriage problem under pairwise preferences. In the most general setting, agents are allowed to express their preferences as comparisons of any two of their edges and they also have the right to…
The Stable Marriage Problem is to find a one-to-one matching for two equally sized sets of agents. Due to its widespread applications in the real world, especially the unique importance to the centralized match maker, a very large number of…
School choice is the two-sided matching market where students (on one side) are to be matched with schools (on the other side) based on their mutual preferences. The classical algorithm to solve this problem is the celebrated deferred…
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.…
The classical stable marriage problem asks for a matching between a set of men and a set of women with no blocking pairs, which are pairs formed by a man and a woman who would both prefer switching from their current status to be paired up…
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…
We study the variant of the stable marriage problem in which the preferences of the agents are allowed to include indifferences. We present a mechanism for producing Pareto-stable matchings in stable marriage markets with indifferences that…
In the celebrated stable-matching problem, there are two sets of agents M and W, and the members of M only have preferences over the members of W and vice versa. It is usually assumed that each member of M and W is a single entity. However,…
In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…
We formulate and solve a finite horizon full balance sheet two-modes optimal switching problem related to trade-off strategies between expected profit and cost yields. Given the current mode, this model allows for either a switch to the…
This contribution focuses on two-party negotiation over continuous issues. We firstly prove two drawbacks of the jointly Improving Direction Method (IDM), namely that IDM is not a Strategy-Proof (SP) nor an Information Concealing (IC)…
We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose--accept rounds executed by the Gale--Shapley algorithm for the stable marriage problem. Consequently, the participants can arrive at…
This paper studies a duopoly investment model with uncertainty. There are two alternative irreversible investments. The first firm to invest gets a monopoly benefit for a specified period of time. The second firm to invest gets information…
In the theory of two-sided matching markets there are two well-known models: the marriage model (where no money is involved) and the assignment model (where payments are involved). Roth and Sotomayor (1990) asked for an explanation for the…
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…
In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to represent those situations where, due to lack of information,…
Consider the group of $n$ men and $n$ women, each with their own preference list for a potential marriage partner. The stable marriage is a bipartite matching such that no unmatched pair (man, woman) prefer each other to their partners in…