Parameterized Analysis of Assignment Under Multiple Preferences

Barak Steindl, Meirav Zehavi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The Assignment problem is a fundamental and well-studied problem in the intersection of Social Choice, Computational Economics and Discrete Allocation. In the Assignment problem, a group of agents expresses preferences over a set of items, and the task is to find a pareto optimal allocation of items to agents. We introduce a generalized version of this problem, where each agent is equipped with multiple incomplete preference lists: each list (called a layer) is a ranking of items in a possibly different way according to a different criterion. We introduce the concept of global optimality, which extends the notion of pareto optimality to the multi-layered setting, and we focus on the problem of deciding whether a globally optimal assignment exists. We study this problem from the perspective of Parameterized Complexity: we consider several natural parameters such as the number of layers, the number of agents, the number of items, and the maximum length of a preference list. We present a comprehensive picture of the parameterized complexity of the problem with respect to these parameters.

Original languageEnglish
Title of host publicationMulti-Agent Systems
Subtitle of host publication18th European Conference, EUMAS 2021, Revised Selected Papers
EditorsAriel Rosenfeld, Nimrod Talmon
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages18
ISBN (Electronic)9783030822545
ISBN (Print)9783030822538
StatePublished - 2021
Event18th European Conference on Multi-Agent Systems, EUMAS 2021 - Virtual, Online
Duration: 28 Jun 202129 Jun 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12802 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference18th European Conference on Multi-Agent Systems, EUMAS 2021
CityVirtual, Online

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Parameterized Analysis of Assignment Under Multiple Preferences'. Together they form a unique fingerprint.

Cite this