Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness

We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents with additive valuation functions. We assume no monetary transfers and, therefore, a mechanism in our setting is an algorithm that takes as input the reported -- rather than the true -- values of the...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Amanatidis, Georgios, Birmpas, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Reiffenhäuser, Rebecca
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 11.12.2023
Subjects:
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents with additive valuation functions. We assume no monetary transfers and, therefore, a mechanism in our setting is an algorithm that takes as input the reported -- rather than the true -- values of the agents. Our main goal is to explore whether there exist mechanisms that have pure Nash equilibria for every instance and, at the same time, provide fairness guarantees for the allocations that correspond to these equilibria. We focus on two relaxations of envy-freeness, namely envy-freeness up to one good (EF1), and envy-freeness up to any good (EFX), and we positively answer the above question. In particular, we study two algorithms that are known to produce such allocations in the non-strategic setting: Round-Robin (EF1 allocations for any number of agents) and a cut-and-choose algorithm of Plaut and Roughgarden [SIAM Journal of Discrete Mathematics, 2020] (EFX allocations for two agents). For Round-Robin we show that all of its pure Nash equilibria induce allocations that are EF1 with respect to the underlying true values, while for the algorithm of Plaut and Roughgarden we show that the corresponding allocations not only are EFX but also satisfy maximin share fairness, something that is not true for this algorithm in the non-strategic setting! Further, we show that a weaker version of the latter result holds for any mechanism for two agents that always has pure Nash equilibria which all induce EFX allocations.
AbstractList We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents with additive valuation functions. We assume no monetary transfers and, therefore, a mechanism in our setting is an algorithm that takes as input the reported -- rather than the true -- values of the agents. Our main goal is to explore whether there exist mechanisms that have pure Nash equilibria for every instance and, at the same time, provide fairness guarantees for the allocations that correspond to these equilibria. We focus on two relaxations of envy-freeness, namely envy-freeness up to one good (EF1), and envy-freeness up to any good (EFX), and we positively answer the above question. In particular, we study two algorithms that are known to produce such allocations in the non-strategic setting: Round-Robin (EF1 allocations for any number of agents) and a cut-and-choose algorithm of Plaut and Roughgarden [SIAM Journal of Discrete Mathematics, 2020] (EFX allocations for two agents). For Round-Robin we show that all of its pure Nash equilibria induce allocations that are EF1 with respect to the underlying true values, while for the algorithm of Plaut and Roughgarden we show that the corresponding allocations not only are EFX but also satisfy maximin share fairness, something that is not true for this algorithm in the non-strategic setting! Further, we show that a weaker version of the latter result holds for any mechanism for two agents that always has pure Nash equilibria which all induce EFX allocations.
Author Leonardi, Stefano
Amanatidis, Georgios
Birmpas, Georgios
Reiffenhäuser, Rebecca
Fusco, Federico
Lazos, Philip
Author_xml – sequence: 1
  givenname: Georgios
  surname: Amanatidis
  fullname: Amanatidis, Georgios
– sequence: 2
  givenname: Georgios
  surname: Birmpas
  fullname: Birmpas, Georgios
– sequence: 3
  givenname: Federico
  surname: Fusco
  fullname: Fusco, Federico
– sequence: 4
  givenname: Philip
  surname: Lazos
  fullname: Lazos, Philip
– sequence: 5
  givenname: Stefano
  surname: Leonardi
  fullname: Leonardi, Stefano
– sequence: 6
  givenname: Rebecca
  surname: Reiffenhäuser
  fullname: Reiffenhäuser, Rebecca
BookMark eNotjU9LwzAcQIMoOOc-gLeA59Y0f9rUWxnbHAwVtvv4tfmlZpTEJe3w4zvQ0-Nd3nsgtz54JOSpYLnUSrEXiD_ukvOC1TnTpZQ3ZMaFKDItOb8ni5ROjDFeVlwpMSP7ZhhCB6PzPd164y4uuXZAugnBJDoGuh8jjNi7jjY9-jG90s8pIn2H9EVX58kNro0OKHhD1-Cix5QeyZ2FIeHin3NyWK8Oy7ds97HZLptdBorrrBMSjbKmgNrUVqMGIZhRnURra1u3FrmW3dVLYzhw22pj0ZZQQGlAGS7m5Pkv-x3DecI0Hk9hiv56PHJVSSU1q7T4BV2oVQY
ContentType Paper
Copyright 2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.2109.08644
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central (NC Live)
Technology collection
ProQuest One
ProQuest Central
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database (subscription)
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a528-c34ed5fd1a9d9f8e8a330d5c4eff9f9bfe284c5c46dd2a2fb8dfef6a1a6da5d23
IEDL.DBID M7S
IngestDate Mon Jun 30 09:22:28 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a528-c34ed5fd1a9d9f8e8a330d5c4eff9f9bfe284c5c46dd2a2fb8dfef6a1a6da5d23
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2574548078?pq-origsite=%requestingapplication%
PQID 2574548078
PQPubID 2050157
ParticipantIDs proquest_journals_2574548078
PublicationCentury 2000
PublicationDate 20231211
PublicationDateYYYYMMDD 2023-12-11
PublicationDate_xml – month: 12
  year: 2023
  text: 20231211
  day: 11
PublicationDecade 2020
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2023
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.8534629
SecondaryResourceType preprint
Snippet We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents with additive valuation functions. We assume no monetary...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Algorithms
Allocations
Design of experiments
Equilibrium
Reagents
Title Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
URI https://www.proquest.com/docview/2574548078
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagBYmJt3iUygNr2iZ2EpsFFdRCB6KIdihT5aeIVCVt0lb8fGyTwoDEwmh5sGWf7853390HwK2iUlAd9TwuufSMCeCe8RKwhxCOkOrZOh_iyCbiJCHTKU3rgFtVwyq3OtEpalkIGyPvGtHCtjdZTO4XS8-yRtnsak2hsQuatkuC76B74-8YSxDFxmNGX8lM17qry8qPbNMx_xzaMc48xr9UsLMrw8P_7ugINFO2UOUx2FH5Cdh3eE5RnYJxf26tlMU0w5GruTKiP1fwqShkBVcF3HalFbBvi6uqO5iuSwUTVr3DwXKduVIABlku4ZBlpVWIZ2AyHEwen72aP8FjYUA8gbCSoZY-o5JqoghDqCdDgZXWVFOulTFNwowjKQMWaE6kVjpiPoskC2WAzkEjL3J1AWAcSYy5FiSiGFPCiVmAG98GUcFtKPQStLZHNKvfQDX7OZ-rv6evwYElcbcgEd9vgcaqXKsbsCc2q6wq26D5MEjS17a7WjNKRy_p2ycM5LA5
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LTwIxEG4IaPTkOz5Qe9Dj8tjtLq2JMURBCEhI4MCN9Bk3IbuwC6g_yv9oW1g9mHjj4HHTw6ad6TePfjMDwI0kghMVVBwmmHC0CWCO9hKQ43ko8GTF1PlgO2yi1uvh0Yj0c-Azq4UxtMoMEy1Qi5ibHHlZqxYyvclq-GE6c8zUKPO6mo3QWKlFR3686ZAtvW8_afneum6zMXxsOeupAg71XexwD0nhK1GlRBCFJaY6ohc-R1IpoghTUgM219-BEC51FcNCSRXQKg0E9YXpc6ARv6C9CJdYpuDgO6XjBjXtoHurt1PbKaxMk_dwWdJhFSnp2AGhX4hvzVhz758dwD4o9OlUJgcgJ6NDsG3Zqjw9AoP6xNhgw9iGbVtRpi_2RMLnOBYpnMcw67nLYd2UjqV3sL9IJOzR9BU2ZovQFjpQSCMBmzRMDNwfg-EmtnEC8lEcyVMAa4FAiCmOA4IQwQzrHzDtuXmEM5PoPQPFTCLj9Q1Pxz_iOP97-RrstIYv3XG33etcgF0zrt7QYarVIsjPk4W8BFt8OQ_T5MpqEwTjDQvvC62ODqY
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Allocating+Indivisible+Goods+to+Strategic+Agents%3A+Pure+Nash+Equilibria+and+Fairness&rft.jtitle=arXiv.org&rft.au=Amanatidis%2C+Georgios&rft.au=Birmpas%2C+Georgios&rft.au=Fusco%2C+Federico&rft.au=Lazos%2C+Philip&rft.date=2023-12-11&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2109.08644