Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/260136 
Year of Publication: 
2014
Series/Report no.: 
Working Paper No. 2014:40
Publisher: 
Lund University, School of Economics and Management, Department of Economics, Lund
Abstract: 
We study two-sided ("marriage") and general pairing ("roommate") problems. We introduce "sequences," lists of matchings that are repeated in order. Stable sequences are natural extensions of stable matchings; case in point, we show that a sequence of stable matchings is stable. In addition, stable sequences can provide solutions to problems for which stable matchings do not exist. In a sense, they allow us to "balance" the interest of the agents at different matchings. In this way, sequences can be superior to matchings in terms of welfare and fairness. A seminal result due to Roth (1982, Math Oper Res 7(4), 617-628) is that no strategy-proof rule always selects stable matchings. In contrast, we show that there is a weakly group sd-strategy-proof rule that selects stable sequences. We call it the Compromises and Rewards rule, CR. We find that stronger incentive properties are incompatible with much weaker stability properties and vice versa. The CR rule satisfies two fairness axioms: anonymity and side neutrality. For the general problem, the Generalized CR rule is sd-5-stable (cannot be blocked by groups of five or fewer agents), weakly sd-strategy-proof, and anonymous. In addition, the Extended All-Proposing Deferred Acceptance rule is sd-stable, anonymous, and individually rational at all times on a restricted domain. We provide a condition under which our results still hold if agents have cardinal preferences and compare sequences using "expected utility."
Subjects: 
Pairing problems
Sequences
Stability
Strategy-proofness
Algorithms
JEL: 
C62
D02
D60
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.