Parameterized Algorithms for Finding a Collective Set of Items
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Parameterized Algorithms for Finding a Collective Set of Items
Original language description
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.
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
1838-1845
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
—