 visitante ::
identificación
|
|||||||||||||||
|
Buscar | Enviar | Ayuda | Servicio de Bibliotecas | Sobre el DDD | Català English Español | |||||||||
| Página principal > Artículos > Artículos publicados > On finding an envy-free Pareto-optimal division |
| Fecha: | 1998 |
| Resumen: | 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. . |
| Derechos: | Tots els drets reservats.  |
| Lengua: | Anglès |
| Documento: | Article ; recerca ; Versió publicada |
| Materia: | Envy-freeness ; Pareto-optimality ; Walras equilibrium |
| Publicado en: | Mathematical Programming, vol. 83 n. 2 (1998) p. 291-311, ISSN 0025-5610 |
 Acceso restringido a la UAB |
