Individual Rationality in Topological Distance Games is Surprisingly Hard

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F24%3A00374698" target="_blank" >RIV/68407700:21240/24:00374698 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.24963/ijcai.2024/308" target="_blank" >https://doi.org/10.24963/ijcai.2024/308</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.24963/ijcai.2024/308" target="_blank" >10.24963/ijcai.2024/308</a>

Result language

angličtina

Original language name

Individual Rationality in Topological Distance Games is Surprisingly Hard

Original language description

In the recently introduced topological distance games, strategic agents need to be assigned to a subset of vertices of a topology. In the assignment, the utility of an agent depends on both the agent's inherent utilities for other agents and its distance from them on the topology. We study the computational complexity of finding individually-rational outcomes; this notion is widely assumed to be the very minimal stability requirement and requires that the utility of every agent in a solution is non-negative. We perform a comprehensive study of the problem's complexity, and we prove that even in very basic cases, deciding whether an individually-rational solution exists is intractable. To reach at least some tractability, one needs to combine multiple restrictions of the input instance, including the number of agents and the topology and the influence of distant agents on the utility.

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

<a href="/en/project/EH22_008%2F0004590" target="_blank" >EH22_008/0004590: Robotics and advanced industrial production</a><br>

Continuities

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

Publication year

2024

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

Proceedings of the 33rd International Joint Conference on Artificial Intelligence

ISBN

978-1-956792-04-1

ISSN

1045-0823

e-ISSN

—

Number of pages

9

Pages from-to

2782-2790

Publisher name

International Joint Conferences on Artificial Intelligence Organization

Place of publication

—

Event location

Jeju

Event date

Aug 3, 2024

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

001347142802100