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

Samuel Bismuth; Ivan Bliznets; Erel Segal-Halevi

doi:10.1007/978-3-031-71033-9_6

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

Samuel Bismuth
, Ivan Bliznets
, Erel Segal-Halevi

Ariel University
University of Groningen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

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 language	English
Title of host publication	Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings
Editors	Guido Schäfer, Carmine Ventre
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	89-107
Number of pages	19
ISBN (Print)	9783031710322
DOIs	https://doi.org/10.1007/978-3-031-71033-9_6
State	Published - 2024
Externally published	Yes
Event	17th International Symposium on Algorithmic Game Theory, SAGT 2024 - Amsterdam, Netherlands Duration: 3 Sep 2024 → 6 Sep 2024

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	15156 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	17th International Symposium on Algorithmic Game Theory, SAGT 2024
Country/Territory	Netherlands
City	Amsterdam
Period	3/09/24 → 6/09/24

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

Keywords

Allocation of Indivisible and Divisible Goods
Fair Division
Indivisible Goods

Access to Document

10.1007/978-3-031-71033-9_6

Cite this

Bismuth, S., Bliznets, I., & Segal-Halevi, E. (2024). Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations. In G. Schäfer, & C. Ventre (Eds.), Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings (pp. 89-107). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 15156 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-71033-9_6

Bismuth, Samuel ; Bliznets, Ivan ; Segal-Halevi, Erel. / Fair Division with Bounded Sharing : Binary and Non-degenerate Valuations. Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings. editor / Guido Schäfer ; Carmine Ventre. Springer Science and Business Media Deutschland GmbH, 2024. pp. 89-107 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{71ff98a662cc401f826d1d05815098f4,

title = "Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations",

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{\textquoteright} 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].",

keywords = "Allocation of Indivisible and Divisible Goods, Fair Division, Indivisible Goods",

author = "Samuel Bismuth and Ivan Bliznets and Erel Segal-Halevi",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.; 17th International Symposium on Algorithmic Game Theory, SAGT 2024 ; Conference date: 03-09-2024 Through 06-09-2024",

year = "2024",

doi = "10.1007/978-3-031-71033-9\_6",

language = "אנגלית",

isbn = "9783031710322",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "89--107",

editor = "Guido Sch{\"a}fer and Carmine Ventre",

booktitle = "Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings",

address = "גרמניה",

}

Bismuth, S, Bliznets, I & Segal-Halevi, E 2024, Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations. in G Schäfer & C Ventre (eds), Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 15156 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 89-107, 17th International Symposium on Algorithmic Game Theory, SAGT 2024, Amsterdam, Netherlands, 3/09/24. https://doi.org/10.1007/978-3-031-71033-9_6

Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations. / Bismuth, Samuel; Bliznets, Ivan; Segal-Halevi, Erel.
Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings. ed. / Guido Schäfer; Carmine Ventre. Springer Science and Business Media Deutschland GmbH, 2024. p. 89-107 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 15156 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Fair Division with Bounded Sharing

T2 - 17th International Symposium on Algorithmic Game Theory, SAGT 2024

AU - Bismuth, Samuel

AU - Bliznets, Ivan

AU - Segal-Halevi, Erel

N1 - Publisher Copyright: © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

PY - 2024

Y1 - 2024

N2 - 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].

AB - 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].

KW - Allocation of Indivisible and Divisible Goods

KW - Fair Division

KW - Indivisible Goods

UR - https://www.scopus.com/pages/publications/85204373668

U2 - 10.1007/978-3-031-71033-9_6

DO - 10.1007/978-3-031-71033-9_6

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85204373668

SN - 9783031710322

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 89

EP - 107

BT - Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings

A2 - Schäfer, Guido

A2 - Ventre, Carmine

PB - Springer Science and Business Media Deutschland GmbH

Y2 - 3 September 2024 through 6 September 2024

ER -

Bismuth S, Bliznets I, Segal-Halevi E. Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations. In Schäfer G, Ventre C, editors, Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Proceedings. Springer Science and Business Media Deutschland GmbH. 2024. p. 89-107. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-71033-9_6