Group robust stability in matching markets

We introduce the notion of group robust stability which requires robustness against a combined manipulation, first misreporting preferences and then rematching, by any group of students in the school choice type of matching markets. Our first result shows that there is no group robustly stable mechanism even under acyclic priority structures. Next, we define a weak version of group robust stability, called weak group robust stability. Our main theorem, then, proves that there is a weakly group robustly stable mechanism if and only if the priority structure of schools is acyclic, and in that case, it coincides with the student-optimal stable mechanism.     

Credible group stability in many-to-many matching problems

It is known that in two-sided many-to-many matching problems, pairwise-stable matchings may not be immune to group deviations, unlike in many-to-one matching problems (Blair, 1988). In this paper, we show that pairwise stability is equivalent to credible group stability when one side has responsive preferences and the other side has categorywise-responsive preferences. A credibly group-stable matching is immune to any “executable” group deviations with an appropriate definition of executability. Under the same preference restriction, we also show the equivalence between the set of pairwise-stable matchings and the set of matchings generated by coalition-proof Nash equilibria of an appropriately defined strategic-form game.     

Substitutes and stability for matching with contracts

We consider the matching with contracts framework of Hatfield and Milgrom [20], and we introduce new concepts of bilateral and unilateral substitutes. We show that the bilateral substitutes condition is a sufficient condition for the existence of a stable allocation in this framework. However, the set of stable allocations does not form a lattice under this condition, and there does not necessarily exist a doctor-optimal stable allocation. Under a slightly stronger condition, unilateral substitutes, the set of stable allocations still does not necessarily form a lattice with respect to doctors' preferences, but there does exist a doctor-optimal stable allocation, and other key results such as incentive compatibility and the rural hospitals theorem are recovered.     

Two-sided matching with interdependent values

We introduce and study two-sided matching with incomplete information and interdependent valuations on one side of the market. An example of such a setting is a matching market between colleges and students in which colleges receive partially informative signals about students. Stability in such markets depends on the amount of information about matchings available to colleges. When colleges observe the entire matching, a stable matching mechanism does not generally exist. When colleges observe only their own matches, a stable mechanism exists if students have identical preferences over colleges, but may not exist if students have different preferences.     

Market structure and matching with contracts

Ostrovsky (2008) [9] develops a theory of stability for a model of matching in exogenously given networks. For this model a generalization of pairwise stability, chain stability, can always be satisfied as long as agents' preferences satisfy same side substitutability and cross side complementarity. Given this preference domain I analyze the interplay between properties of the network structure and (cooperative) solution concepts. The main structural condition is an acyclicity notion that rules out the implementation of trading cycles. It is shown that this condition and the restriction that no pair of agents can sign more than one contract with each other are jointly necessary and sufficient for (i) the equivalence of group and chain stability, (ii) the core stability of chain stable networks, (iii) the efficiency of chain stable networks, (iv) the existence of a group stable network, and (v) the existence of an efficient and individually stable network. These equivalences also provide a rationale for chain stability in the unrestricted model. The (more restrictive) conditions under which chain stability coincides with the core are also characterized.     

Von Neumann-Morgenstern stable sets in matching problems

The following properties of the core of a one-to-one matching problem are well-known: (i) the core is non-empty; (ii) the core is a distributive lattice; and (iii) the set of unmatched agents is the same for any two matchings belonging to the core. The literature on two-sided matching focuses almost exclusively on the core and studies extensively its properties. Our main result is the following characterization of (Von Neumann-Morgenstern) stable sets in one-to-one matching problems. We show that a set V of matchings is a stable set of a one-to-one matching problem only if V is a maximal set satisfying the following properties: (a) the core is a subset of V; (b) V is a distributive lattice; and (c) the set of unmatched agents is the same for all matchings belonging to V. Furthermore, a set is a stable set if it is the unique maximal set satisfying properties (a), (b), and (c).     

Relaxing the substitutes condition in matching markets with contracts

In the many-to-one matching model with contracts, I provide new necessary and new sufficient conditions for the existence of a stable allocation. These new conditions exploit the fact that one side of the market has strict preferences over individual contracts.     

Incomplete information and singleton cores in matching markets

We study ordinal Bayesian Nash equilibria of stable mechanisms in centralized matching markets under incomplete information. We show that truth-telling is an ordinal Bayesian Nash equilibrium of the revelation game induced by a common belief and a stable mechanism if and only if all the profiles in the support of the common belief have singleton cores. Our result matches the observations of Roth and Peranson [The redesign of the matching market for American physicians: some engineering aspects of economic design, Amer. Econ. Rev. 89 (1999) 748-780] in the National Resident Matching Program (NRMP) in the United States: (i) the cores of the profiles submitted to the clearinghouse are small and (ii) while truth-telling is not a dominant strategy most participants in the NRMP truthfully reveal their preferences.     

Stable schedule matching under revealed preference

Baiou and Balinski (Math. Oper. Res., 27 (2002) 485) studied schedule matching where one determines the partnerships that form and how much time they spend together, under the assumption that each agent has a ranking on all potential partners. Here we study schedule matching under more general preferences that extend the substitutable preferences in Roth (Econometrica 52 (1984) 47) by an extension of the revealed preference approach in Alkan (Econom. Theory 19 (2002) 737). We give a generalization of the Gale-Shapley algorithm and show that some familiar properties of ordinary stable matchings continue to hold. Our main result is that, when preferences satisfy an additional property called size monotonicity, stable matchings are a lattice under the joint preferences of all agents on each side and have other interesting structural properties.     

The rate of convergence to perfect competition of matching and bargaining mechanisms

We study the steady state of a market with incoming cohorts of buyers and sellers who are matched pairwise and bargain under private information. A friction parameter is τ, the length of the time period until the next meeting. We provide a necessary and sufficient condition for the convergence of mechanism outcomes to perfect competition at the linear rate in τ, which is shown to be the fastest possible among all bargaining mechanisms. The condition requires that buyers and sellers always retain some bargaining power. The bargaining mechanisms that satisfy this condition are called nonvanishing bargaining power (NBP) mechanisms. Simple random proposer take-it-or-leave-it protocols are NBP, while k-double auctions (k-DA) are not. We find that k-DAs have equilibria that converge to perfect competition at a linear rate, converge at a slower rate or even do not converge at all.     

On the observational equivalence of random matching

Random matching is often used in economic models as a means of introducing uncertainty in sequential decision problems. We show that random matching processes that satisfy standard proportionality laws are not unique. We give conditions on the payoffs and transition functions of sequential decision models that insure that economic models are robust to the nonuniqueness of the matching process. Under these conditions, the information contained in the proportionality laws is all that is needed to know about the matching process to formulate the model.     

On two competing mechanisms for priority-based allocation problems

We consider the priority-based allocation problem: there is a set of indivisible objects with multiple supplies (e.g., schools with seats) and a set of agents (e.g., students) with priorities over objects (e.g., proximity of residence area). We study two well-known and competing mechanisms. The agent-optimal stable mechanism (AOSM) allots objects via the deferred acceptance algorithm. The top trading cycles mechanism (TTCM) allots objects via Gale's top trading cycles algorithm. We show that the two mechanisms are equivalent, or TTCM is fair (i.e., respects agents’ priorities), or resource monotonic, or population monotonic, if and only if the priority structure is acyclic. Furthermore, if AOSM fails to be efficient (consistent) for a problem, TTCM also fails to be fair (consistent) for it. However, the converse is not necessarily true.     

On randomized matching mechanisms

Summary This note showed by means of Knuth's example that some stable matchings may not be obtained by the random order mechanism.I wish to thank an anonymous referee for helpful comments that have greatly improved the presentation of the paper.     

Stable partnerships, matching, and local public goods

In the presence of local public goods differences in tastes are an important determinant of the way in which partnerships are formed. Heterogeneity in tastes for private vs. public goods produces a tendency to positive assortment and partnerships of couples with similar tastes; heterogeneity in tastes for different public goods brings about partnerships of couples with similar tastes only if there is a significant overlap in the distribution of tastes of the two groups to be matched. We show that with two public goods we may get negative assortment, pure positive assortment being only one of many possibilities.     

Random matching in the college admissions problem

In the college admissions problem, we consider the incentives confronting agents who face the prospect of being matched by a random stable mechanism. We provide a fairly complete characterization of ordinal equilibria. Namely, every ordinal equilibrium yields a degenerate probability distribution. Furthermore, individual rationality is a necessary and sufficient condition for an equilibrium outcome, while stability is guaranteed in ordinal equilibria where firms act straightforwardly. Finally, we relate equilibrium behavior in random and in deterministic mechanisms.     

Characterizations of bargaining solutions in production economies with unequal skills

In production economies with unequal skills, this paper characterizes bargaining solutions by using axioms on allocation rules rather than axioms on classical bargaining solutions. We introduce a new axiom, consistency w.r.t. technological innovations, so that the non-welfaristic characterizations of bargaining solutions in the production economies are provided. By the characterizations, we can classify the three bargaining solutions (the Nash, the Kalai-Smorodinsky, and the Egalitarian solutions) from the viewpoint of responsibility and compensation discussed by Dworkin.     

Symmetry-based compromise and the Nash solution to convex bargaining problems

A new axiom, symmetry-based compromise, is introduced to study solutions to convex bargaining problems. It is shown that any efficient solution that is also scale invariant and satisfies symmetry-based compromise must be Nash.     

Additivity in bankruptcy problems and in allocation problems

We study the property of additivity in bankruptcy problems and in allocation problems. In bankruptcy problems we use this property to characterize the Talmudic rule proposed by Rabbi Ibn Ezra. Moreover we generalize this rule to every bankruptcy problem. Again, using additivity we characterize the rights egalitarian solution in allocation problems.     

Median stable matching for markets with wages

We define the median stable matching for two-sided matching markets with wages and prove constructively that it exists.     

Connecting the cooperative and competitive structures of the multiple-partners assignment game

Multiple-partners assignment game is the name used by Sotomayor [The multiple partners game, in: M. Majumdar (Ed.), Equilibrium and Dynamics: Essays in Honor of David Gale, The Macmillan Press Ltd., New York, 1992; The lattice structure of the set of stable outcomes of the multiple partners assignment game, Int. J. Game Theory 28 (1999) 567-583] to describe the cooperative structure of the many-to-many matching market with additively separable utilities. Stability concept is proved to be different from the core concept. An economic structure is proposed where the concept of competitive equilibrium payoff is introduced in connection to the equilibrium concept from standard microeconomic theory. The paper examines how this equilibrium concept compares with the cooperative equilibrium concept. Properties of interest to the cooperative and competitive markets are derived.