Multidimensional Stable Roommates with Master List

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F20%3A00345575" target="_blank" >RIV/68407700:21240/20:00345575 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1007/978-3-030-64946-3_5" target="_blank" >https://doi.org/10.1007/978-3-030-64946-3_5</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-64946-3_5" target="_blank" >10.1007/978-3-030-64946-3_5</a>

Result language

angličtina

Original language name

Multidimensional Stable Roommates with Master List

Original language description

Since the early days of research in algorithms and complexity, the computation of stable matchings is a core topic. While in the classic setting the goal is to match up two agents (either from different “gender” (this is Stable Marriage) or “unrestricted” (this is Stable Roommates)), Knuth [1976] triggered the study of three- or multidimensional cases. Here, we focus on the study of Multidimensional Stable Roommates, known to be ???????? -hard since the early 1990’s. Many ???????? -hardness results, however, rely on very general input instances that do not occur in at least some of the specific application scenarios. With the quest for identifying islands of tractability, we look at the case of master lists. Here, as natural in applications where agents express their preferences based on “objective” scores, one roughly speaking assumes that all agent preferences are “derived from” a central master list, implying that the individual agent preferences shall be similar. Master lists have been frequently studied in the two-dimensional (classic) stable matching case, but seemingly almost never for the multidimensional case. This work, also relying on methods from parameterized algorithm design and complexity analysis, performs a first systematic study of Multidimensional Stable Roommates under the assumption of master lists.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2020

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Web and Internet Economics - 16th International Conference, WINE 2020, Beijing, China, December 7-11, 2020, Proceedings

ISBN

978-3-030-64945-6

ISSN

—

e-ISSN

—

Number of pages

15

Pages from-to

59-73

Publisher name

Springer

Place of publication

Cham

Event location

Beijing

Event date

Dec 7, 2020

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—