On finding an envy-free Pareto-optimal division
| Autor: | J. H. Reijnierse, Jos A. M. Potters |
|---|---|
| Rok vydání: | 1998 |
| Předmět: |
Exact division
Computer Science::Computer Science and Game Theory Mathematical optimization Euclidean division General Mathematics Numerical analysis Division (mathematics) Envy-free Polynomial long division Computer Science::Multiagent Systems Pareto optimal Stochastics and operational research Mathematical economics Finite set Software Mathematics |
| Zdroj: | Mathematical Programming, 83, pp. 291-311 Mathematical Programming, 83, 291-311 |
| ISSN: | 1436-4646 0025-5610 |
| DOI: | 10.1007/bf02680564 |
| Popis: | This paper describes an algorithm to find an (α-)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 α-envy-free. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink