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

Samuel Bismuth*, Ivan Bliznets, Erel Segal-Halevi

*Corresponding author voor dit werk

OnderzoeksoutputAcademicpeer review

1 Citaat (Scopus)
27 Downloads (Pure)

Samenvatting

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.
Originele taal-2English
TitelAlgorithmic Game Theory
Subtitel17th International Symposium, SAGT 2024, Amsterdam, The Netherlands, September 3-6, 2024, Proceedings.
RedacteurenGuido Schäfer, Carmine Ventre
UitgeverijSpringer
Pagina's89–107
Aantal pagina's19
ISBN van elektronische versie978-3-031-71033-9
ISBN van geprinte versie978-3-031-71032-2
DOI's
StatusPublished - 2024

Publicatie series

NaamLecture Notes in Computer Science
UitgeverijSpringer
Volume15156
ISSN van geprinte versie0302-9743
ISSN van elektronische versie1611-3349

Vingerafdruk

Duik in de onderzoeksthema's van 'Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations'. Samen vormen ze een unieke vingerafdruk.

Citeer dit