License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2017.52
URN: urn:nbn:de:0030-drops-79719
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7971/
Go to the corresponding LIPIcs Volume Portal


Garg, Vijay K.

Brief Announcement: Applying Predicate Detection to the Stable Marriage Problem

pdf-format:
LIPIcs-DISC-2017-52.pdf (0.4 MB)


Abstract

We show that many techniques developed in the context of predicate detection are applicable to the stable marriage problem. The standard Gale-Shapley algorithm can be derived as a special case of detecting linear predicates. We also show that techniques in computation slicing can be used to represent the set of all constrained stable matchings.

BibTeX - Entry

@InProceedings{garg:LIPIcs:2017:7971,
  author =	{Vijay K. Garg},
  title =	{{Brief Announcement: Applying Predicate Detection to the Stable Marriage Problem}},
  booktitle =	{31st International Symposium on Distributed Computing (DISC 2017)},
  pages =	{52:1--52:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-053-8},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{91},
  editor =	{Andr{\'e}a W. Richa},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7971},
  URN =		{urn:nbn:de:0030-drops-79719},
  doi =		{10.4230/LIPIcs.DISC.2017.52},
  annote =	{Keywords: Stable Matching, Linear Predicates, Distributive Lattices}
}

Keywords: Stable Matching, Linear Predicates, Distributive Lattices
Seminar: 31st International Symposium on Distributed Computing (DISC 2017)
Issue Date: 2017
Date of publication: 05.10.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI