The envy-free matching problem with pairwise preferences

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we consider the situation where each agent has a preference over a subset of items and exactly one item is matched to each agent. The envy-freeness of a matching guarantees that no one has envy for the others. We consider an envy-free matching in the situation where each agent has a preference that is defined based on comparisons of any two acceptable items. We prove that in this situation, the problem of checking the existence of an envy-free matching is generally hard.

Original languageEnglish
Article number106158
JournalInformation Processing Letters
Volume172
DOIs
Publication statusPublished - Dec 2021

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'The envy-free matching problem with pairwise preferences'. Together they form a unique fingerprint.

Cite this