NO-ENVY AND CONSISTENCY IN ECONOMIES WITH INDIVISIBLE GOODS

被引:78
|
作者
TADENUMA, K [1 ]
THOMSON, W [1 ]
机构
[1] UNIV ROCHESTER,DEPT ECON,ROCHESTER,NY 14627
关键词
NO-ENVY; CONSISTENCY; INDIVISIBLE GOODS;
D O I
10.2307/2938288
中图分类号
F [经济];
学科分类号
02 ;
摘要
We consider the problem of fair allocation in economies with indivisible goods. Our main objective is to identify appealing subsolutions of the no-envy solution. We formulate desirable properties of solutions, and look for solutions satisfying them: given an allocation chosen by a solution for some economy and given a subgroup of the agents, consider the problem of fairly distributing among its members the resources that this group has collectively received. The solution is consistent if it recommends that the same bundle be attributed to each of these agents as initially. We show that there is no proper subsolution of the no-envy solution that satisfies consistency. However, many subsolutions satisfy bilateral consistency or the converse of consistency. But again, there is no proper subsolution satisfying these two properties together.
引用
收藏
页码:1755 / 1767
页数:13
相关论文
共 50 条
  • [31] No-envy and dominant strategy implementability in non -excludable public good economies with quasi-linear preferences
    Nishizaki, Katsuhiko
    ECONOMICS BULLETIN, 2013, 33 (01): : 557 - 563
  • [32] Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity
    Bouveret, Sylvain
    Lang, Jerome
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2008, 32 (525-564): : 525 - 564
  • [33] Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
    Bouveret, Sylvain
    Lang, Jerome
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 935 - 940
  • [34] Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods
    Garg, Jugal
    Murhekar, Aniket
    Journal of Artificial Intelligence Research, 2024, 80 : 1 - 25
  • [35] On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
    de Keijzer, Bart
    Bouveret, Sylvain
    Klos, Tomas
    Zhang, Yingqian
    ALGORITHMIC DECISION THEORY, PROCEEDINGS, 2009, 5783 : 98 - +
  • [36] Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods
    Garg, Jugal
    Murhekar, Aniket
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2024, 80 : 1 - 25
  • [37] Average Envy-freeness for Indivisible ItemsAverage Envy-freeness for Indivisible Items
    Han, Qishen
    Tao, Biaoshuai
    Xia, Lirong
    PROCEEDINGS OF 2023 ACM CONFERENCE ON EQUITY AND ACCESS IN ALGORITHMS, MECHANISMS, AND OPTIMIZATION, EAAMO 2023, 2023,
  • [38] Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
    Bouveret, Sylvain
    Endriss, Ulle
    Lang, Jerome
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 387 - 392
  • [39] Coalitionally strategy-proof rules in allotment economies with homogeneous indivisible goods
    Kentaro Hatsumi
    Shigehiro Serizawa
    Social Choice and Welfare, 2009, 33 : 423 - 447
  • [40] Coalitionally strategy-proof rules in allotment economies with homogeneous indivisible goods
    Hatsumi, Kentaro
    Serizawa, Shigehiro
    SOCIAL CHOICE AND WELFARE, 2009, 33 (03) : 423 - 447