A characterization of maximum Nash welfare for indivisible goods

被引:0
|
作者
Suksompong, Warut [1 ]
机构
[1] Natl Univ Singapore, Sch Comp, Singapore, Singapore
关键词
Fair division; Indivisible goods; Maximum Nash welfare;
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
In the allocation of indivisible goods, the maximum Nash welfare (MNW) rule, which chooses an allocation maximizing the product of the agents' utilities, has received substantial attention for its fairness. We characterize MNW as the only additive welfarist rule that satisfies envy-freeness up to one good. Our characterization holds even in the simplest setting of two agents. (c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页数:3
相关论文
共 50 条
  • [1] A characterization of maximum Nash welfare for indivisible goods
    Suksompong, Warut
    ECONOMICS LETTERS, 2023, 222
  • [2] Maximizing Nash product social welfare in allocating indivisible goods
    Darmann, Andreas
    Schauer, Joachim
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 247 (02) : 548 - 559
  • [3] Extending the characterization of maximum Nash welfare
    Yuen, Sheung Man
    Suksompong, Warut
    ECONOMICS LETTERS, 2023, 224
  • [4] Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
    Trung Thanh Nguyen
    Rothe, Joerg
    DISCRETE APPLIED MATHEMATICS, 2014, 179 : 54 - 68
  • [5] Approximating the Nash Social Welfare with Indivisible Items
    Cole, Richard
    Gkatzelis, Vasilis
    STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 371 - 380
  • [6] Approximating the Nash Social Welfare with Indivisible Items
    Cole, Richard
    Gkatzelis, Vasilis
    ACM SIGECOM EXCHANGES, 2015, 14 (01) : 84 - 88
  • [7] Welfare of Sequential Allocation Mechanisms for Indivisible Goods
    Aziz, Haris
    Kalinowski, Thomas
    Walsh, Toby
    Xia, Lirong
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 787 - 794
  • [8] APPROXIMATING THE NASH SOCIAL WELFARE WITH INDIVISIBLE ITEMS
    Cole, Richard
    Gkatzelis, Vasilis
    SIAM JOURNAL ON COMPUTING, 2018, 47 (03) : 1211 - 1236
  • [9] The Unreasonable Fairness of Maximum Nash Welfare
    Caragiannis, Ioannis
    Kurokawa, David
    Moulin, Herve
    Procaccia, Ariel D.
    Shah, Nisarg
    Wang, Junxing
    EC'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2016, : 305 - 322
  • [10] The Unreasonable Fairness of Maximum Nash Welfare
    Caragiannis, Ioannis
    Kurokawa, David
    Moulin, Herve
    Procaccia, Ariel D.
    Shah, Nisarg
    Wang, Junxing
    ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION, 2019, 7 (03)