Brams-Taylor model of fair division for divisible and indivisible items

被引：3
|
作者：
Rubchinsky, Alexander [1 ,2 ]
机构：
[1] Int Univ Dubna Moscow, Moscow, Russia
[2] State Univ, Higher Sch Econ, Moscow, Russia
来源：
MATHEMATICAL SOCIAL SCIENCES | 2010年 / 60卷 / 01期
关键词：
Conflict management; Negotiation; Fairness; Knapsack problem;
D O I：
10.1016/j.mathsocsci.2010.03.004
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
In this article, the fair division problem for two participants in the presence of both divisible and indivisible items is considered. Three interrelated modifications of the notion of fair division profitably, uniformly and equitably fair divisions were introduced. Computationally efficient algorithm for finding all of them was designed. The algorithm includes repetitive solutions of integer knapsack-type problems as its essential steps. The necessary and sufficient conditions of the existence of proportional and equitable division were found. The statements of the article are illustrated by various examples. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：1 / 14
页数：14
相关论文
共 50 条
  • [21] Fair division: From cake-cutting to dispute resolution - Brams,SJ, Taylor,AD
    Rutte, CG
    INTERNATIONAL JOURNAL OF CONFLICT MANAGEMENT, 1997, 8 (01) : 83 - 84
  • [22] Fair division: From cake-cutting to dispute resolution - Brams,SJ, Taylor,AD
    Vallentyne, P
    ETHICS, 1997, 108 (01) : 213 - 215
  • [23] Fair division: From cake-cutting to dispute resolution - Brams,SJ, Taylor,AD
    Mulford, M
    AMERICAN POLITICAL SCIENCE REVIEW, 1997, 91 (03) : 714 - 715
  • [24] Fair Allocation of Indivisible Items with Conflict Graphs
    Chiarelli, Nina
    Krnc, Matjaz
    Milanic, Martin
    Pferschy, Ulrich
    Pivac, Nevena
    Schauer, Joachim
    ALGORITHMICA, 2023, 85 (05) : 1459 - 1489
  • [25] Fair Allocation of Indivisible Items with Conflict Graphs
    Nina Chiarelli
    Matjaž Krnc
    Martin Milanič
    Ulrich Pferschy
    Nevena Pivač
    Joachim Schauer
    Algorithmica, 2023, 85 : 1459 - 1489
  • [26] Fair division of indivisible items between two players: design parameters for Contested Pile methods
    Rudolf Vetschera
    D. Marc Kilgour
    Theory and Decision, 2014, 76 : 547 - 572
  • [27] Two-Person Fair Division of Indivisible Items when Envy-Freeness is Impossible
    Brams S.J.
    Kilgour D.M.
    Klamler C.
    Operations Research Forum, 3 (2)
  • [28] Fair division of indivisible items between two players: design parameters for Contested Pile methods
    Vetschera, Rudolf
    Kilgour, D. Marc
    THEORY AND DECISION, 2014, 76 (04) : 547 - 572
  • [29] TWO-PERSON FAIR DIVISION OF INDIVISIBLE ITEMS: BENTHAM VS. RAWLS ON ENVY
    Brams, Steven J.
    Kilgour, D. Marc
    Klamler, Christian
    Wei, Fan
    JOURNAL OF PHILOSOPHY, 2023, 120 (08): : 441 - 456
  • [30] Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods
    Li, Zihao
    Liu, Shengxin
    Lu, Xinhang
    Tao, Biaoshuai
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 2808 - 2816
12345