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%2F23%3A00368414" target="_blank" >RIV/68407700:21240/23:00368414 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1016/j.artint.2023.104017" target="_blank" >https://doi.org/10.1016/j.artint.2023.104017</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.artint.2023.104017" target="_blank" >10.1016/j.artint.2023.104017</a>

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 some initial complexity-theoretic and existential results concerning Nash and individually stable outcomes. Here, we design new algorithms accompanied with lower bounds which provide a comprehensive 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

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

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

Others

  • Publication year

    2023

  • 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

  • Name of the periodical

    Artificial Intelligence

  • ISSN

    0004-3702

  • e-ISSN

    1872-7921

  • Volume of the periodical

    325

  • Issue of the periodical within the volume

    December

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    20

  • Pages from-to

    1-20

  • UT code for WoS article

    001088398900001

  • EID of the result in the Scopus database

    2-s2.0-85173174687