On finding an envy-free Pareto-optimal division

被引：22

作者：

Reijnierse, JH ^{[1
]}

Potters, JAM ^{[1
]}

机构：

[1] Catholic Univ Nijmegen, Dept Math, NL-6525 ED Nijmegen, Netherlands

来源：

MATHEMATICAL PROGRAMMING | 1998年 / 83卷 / 02期

关键词：

envy-freeness; Pareto-optimality; Walras equilibrium;

D O I：

10.1007/BF02680564

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper describes an algorithm to find an (alpha-)envy-free Pareto-optimal division in the case of a finite number of homogeneous infinitely divisible goods and linear utility functions. It is used to find an allocation in the classical cake division problem that is almost Pareto-optimal and alpha-envy-free. (C) 1998 The Mathematical Programing, Society, Inc. Published by Elsevier Science B.V.

引用

页码：291 / 311

页数：21