DeepAI AI Chat
Log In Sign Up

Parameterized Analysis of Assignment Under Multiple Preferences

by   Barak Steindl, et al.

The Assignment problem is a fundamental, well-studied problem in the intersection of Social Choice, Computational Economics and Discrete Allocation. In the Assignment problem, we seek a pareto optimal allocation of items to agents given the preferences of the 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 a new concept of pareto optimality, and study the generalized version of the problem from the perspective of Parameterized Complexity. Here, we consider several natural parameters such as the number of layers, number of agents, number of items, and maximal length of a preference list; we present a comprehensive picture of the parameterized complexity of the problem with respect to these parameters.


Verification of Multi-Layered Assignment Problems

The class of assignment problems is a fundamental and well-studied class...

Stable Marriage with Multi-Modal Preferences

We introduce a generalized version of the famous Stable Marriage problem...

Allocation of Indivisible Items with Individual Preference Graphs

This paper studies the allocation of indivisible items to agents, when e...

Parallel and Distributed Algorithms for the housing allocation Problem

We give parallel and distributed algorithms for the housing allocation p...

More Effort Towards Multiagent Knapsack

In this paper, we study some multiagent variants of the knapsack problem...

Recognizing when a preference system is close to admitting a master list

A preference system ℐ is an undirected graph where vertices have prefere...

Integer Linear Programming for the Tutor Allocation Problem: A Practical Case in a British University

In the Tutor Allocation Problem, the objective is to assign a set of tut...