On finding an envy-free Pareto-optimal division
Reijnierse, J.H.
Potters, J.A.M.

Data: 1998
Resum: 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. .
Llengua: Anglès.
Document: Article ; recerca ; article ; publishedVersion
Matèria: Envy-freeness ; Pareto-optimality ; Walras equilibrium
Publicat a: Mathematical Programming, vol. 83 n. 2 (1998) p. 291-311, ISSN 0025-5610

21 p, 786.6 KB
 Accés restringit a la UAB

El registre apareix a les col·leccions:
Articles > Articles de recerca
Articles > Articles publicats

 Registre creat el 2006-03-13, darrera modificació el 2017-10-28

   Favorit i Compartir