Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Sequences in Pairing Problems: A New Approach to Reconcile Stability with Strategy-Proofness for Elementary Matching Problems

Gudmundsson, Jens LU (2014) In Working Papers
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... (More)
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." (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Working paper/Preprint
publication status
published
subject
keywords
Pairing problems, Sequences, Stability, Strategy-proofness, Algorithms
in
Working Papers
issue
2014:40
pages
37 pages
language
English
LU publication?
yes
id
147930f9-1c63-4941-92a6-96945ef02853 (old id 4865091)
date added to LUP
2016-04-04 12:02:55
date last changed
2024-10-14 14:50:35
@misc{147930f9-1c63-4941-92a6-96945ef02853,
  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."}},
  author       = {{Gudmundsson, Jens}},
  keywords     = {{Pairing problems; Sequences; Stability; Strategy-proofness; Algorithms}},
  language     = {{eng}},
  note         = {{Working Paper}},
  number       = {{2014:40}},
  series       = {{Working Papers}},
  title        = {{Sequences in Pairing Problems: A New Approach to Reconcile Stability with Strategy-Proofness for Elementary Matching Problems}},
  url          = {{https://lup.lub.lu.se/search/files/195210824/WP14_40.pdf}},
  year         = {{2014}},
}