AI Paper Atlas

Research map / Multi-agent systems and games / Games and equilibria

Parameterized Algorithms for Finding a Collective Set of Items

Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dušan Knop, Rolf Niedermeier

AAAI 2020 · Multi-agent systems and games › Games and equilibria · approach: Fair division and coalition formation

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
parameterize by number of items instead of agentsOWA-WINNER · parameterized complexitytractabilityImproved
parameterize by size k of the collective setOWA-WINNER · parameterized complexitytractabilityHurt
use nonincreasing OWA vectors constant except first or last pi values, parameterized by agents and piOWA-WINNER with arbitrary utilities · parameterized complexitytractabilityImproved
use OWA vectors that are not nonincreasingOWA-WINNER with arbitrary utilities · parameterized complexitytractabilityHurt
switch from beta(1) to beta(2) OWA vectorbeta(i)-WINNER · parameterized by agentstractabilityHurt
restrict to approval utilities with rho nonincreasing piecesalpha-weighted-WINNER · parameterized by agents and rhotractabilityImproved
use FPT algorithm for approval utilities to approximate Borda utilitiesOWA-WINNER · approximationtractabilityImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy