Parameterized Algorithms for Finding a Collective Set of Items

Kód výsledku v IS VaVaI

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

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Parameterized Algorithms for Finding a Collective Set of Items

Popis výsledku v původním jazyce

We extend the work of Skowron et al. (AIJ, 2016) by considering the parameterized complexity of the following problem. We are given a set of items and a set of agents, where each agent assigns an integer utility value to each item. The goal is to find a set of k items that these agents would collectively use. For each such collective set of items, each agent provides a score that can be described using an OWA (ordered weighted average) operator and we seek a set with the highest total score. We focus on the parameterization by the number of agents and we find numerous fixed-parameter tractability results (however, we also find some W[1]-hardness results). It turns out that most of our algorithms even apply to the setting where each agent has an integer weight.

Název v anglickém jazyce

Parameterized Algorithms for Finding a Collective Set of Items

Popis výsledku anglicky

We extend the work of Skowron et al. (AIJ, 2016) by considering the parameterized complexity of the following problem. We are given a set of items and a set of agents, where each agent assigns an integer utility value to each item. The goal is to find a set of k items that these agents would collectively use. For each such collective set of items, each agent provides a score that can be described using an OWA (ordered weighted average) operator and we seek a set with the highest total score. We focus on the parameterization by the number of agents and we find numerous fixed-parameter tractability results (however, we also find some W[1]-hardness results). It turns out that most of our algorithms even apply to the setting where each agent has an integer weight.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2020

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proceedings of the AAAI Conference on Artificial Intelligence

ISBN

—

ISSN

2159-5399

e-ISSN

2374-3468

Počet stran výsledku

8

Strana od-do

1838-1845

Název nakladatele

AAAI Press

Místo vydání

Menlo Park

Místo konání akce

New York

Datum konání akce

7. 2. 2020

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—