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”

Hedonic Diversity Games: A Complexity Picture with More than Two Colors

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F22%3A00358762" target="_blank" >RIV/68407700:21240/22:00358762 - isvavai.cz</a>

  • Result on the web

    <a href="https://ojs.aaai.org/index.php/AAAI/article/view/20435" target="_blank" >https://ojs.aaai.org/index.php/AAAI/article/view/20435</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Hedonic Diversity Games: A Complexity Picture with More than Two Colors

  • Original language description

    Hedonic diversity games are a variant of the classical Hedonic games designed to better model a variety of questions concerning diversity and fairness. Previous works mainly targeted the case with two diversity classes (represented as colors in the model) and provided a set of initial complexity-theoretic and existential results concerning Nash and Individually stable outcomes. Here, we design new algorithms accompanied with lower bounds which provide a full parameterized-complexity picture for computing Nash and Individually stable outcomes with respect to the most natural parameterizations of the problem. Crucially, our results hold for general Hedonic diversity games where the number of colors is not necessarily restricted to two, and show that---apart from two trivial cases---a necessary condition for tractability in this setting is that the number of colors is bounded by the parameter. Moreover, for the special case of two colors we resolve an open question asked in previous work~(Boehmer and Elkind, AAAI 2020).

  • 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

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2022

  • 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 36th AAAI Conference on Artificial Intelligence

  • ISBN

    978-1-57735-876-3

  • ISSN

    2159-5399

  • e-ISSN

    2374-3468

  • Number of pages

    9

  • Pages from-to

    5034-5042

  • Publisher name

    AAAI Press

  • Place of publication

    Menlo Park

  • Event location

    - virtual

  • Event date

    Feb 22, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000893636205015