All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Adapting Stable Matchings to Evolving Preferences

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="https://doi.org/10.1609/aaai.v34i02.5550" target="_blank" >https://doi.org/10.1609/aaai.v34i02.5550</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1609/aaai.v34i02.5550" target="_blank" >10.1609/aaai.v34i02.5550</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Adapting Stable Matchings to Evolving Preferences

  • Original language description

    Adaptivity to changing environments and constraints is key to success in modern society. We address this by proposing “incrementalized versions” of Stable Marriage and Stable Roommates. That is, we try to answer the following question: for both problems, what is the computational cost of adapting an existing stable matching after some of the preferences of the agents have changed. While doing so, we also model the constraint that the new stable matching shall be not too different from the old one. After formalizing these incremental versions, we provide a fairly comprehensive picture of the computational complexity landscape of Incremental Stable Marriage and Incremental Stable Roommates. To this end, we exploit the parameters “degree of change” both in the input (difference between old and new preference profile) and in the output (difference between old and new stable matching). We obtain both hardness and tractability results, in particular showing a fixed-parameter tractability result with respect to the parameter “distance between old and new stable matching”.

  • Czech name

  • Czech description

Classification

  • 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)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2020

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings of the AAAI Conference on Artificial Intelligence

  • ISBN

  • ISSN

    2159-5399

  • e-ISSN

    2374-3468

  • Number of pages

    8

  • Pages from-to

    1830-1837

  • Publisher name

    AAAI Press

  • Place of publication

    Menlo Park

  • Event location

    New York

  • Event date

    Feb 7, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article