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.
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-2 | English |
---|---|
Titel | Algorithmic Game Theory |
Subtitel | 17th International Symposium, SAGT 2024, Amsterdam, The Netherlands, September 3-6, 2024, Proceedings. |
Redacteuren | Guido Schäfer, Carmine Ventre |
Uitgeverij | Springer |
Pagina's | 89–107 |
Aantal pagina's | 19 |
ISBN van elektronische versie | 978-3-031-71033-9 |
ISBN van geprinte versie | 978-3-031-71032-2 |
DOI's | |
Status | Published - 2024 |
Publicatie series
Naam | Lecture Notes in Computer Science |
---|---|
Uitgeverij | Springer |
Volume | 15156 |
ISSN van geprinte versie | 0302-9743 |
ISSN van elektronische versie | 1611-3349 |