Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations

Samuel Bismuth, Ivan Bliznets, Erel Segal-Halevi

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

Abstract

A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. An agent is allowed to share a bounded number of objects between two or more agents in order to attain fairness. The paper studies various notions of fairness, such as proportionality, envy-freeness, equitability, and consensus. We analyze the run-time complexity of finding a fair allocation with a given number of sharings under several restrictions on the agents’ valuations, such as: binary generalized-binary and non-degenerate. — NOTE: due to space constraints, we had to move several parts that appeared on the submitted version to appendices. All material can be found in the full version at https://arxiv.org/abs/1912.00459 [2].

Original languageEnglish
Title of host publicationAlgorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings
EditorsGuido Schäfer, Carmine Ventre
PublisherSpringer Science and Business Media Deutschland GmbH
Pages89-107
Number of pages19
ISBN (Print)9783031710322
DOIs
StatePublished - 2024
Event17th International Symposium on Algorithmic Game Theory, SAGT 2024 - Amsterdam, Netherlands
Duration: 3 Sep 20246 Sep 2024

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume15156 LNCS

Conference

Conference17th International Symposium on Algorithmic Game Theory, SAGT 2024
Country/TerritoryNetherlands
CityAmsterdam
Period3/09/246/09/24

Keywords

  • Allocation of Indivisible and Divisible Goods
  • Fair Division
  • Indivisible Goods

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Cite this