๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On finding an envy-free Pareto-optimal division

โœ Scribed by J. H. Reijnierse; J. A. M. Potters

Book ID
110621517
Publisher
Springer-Verlag
Year
1998
Tongue
English
Weight
954 KB
Volume
83
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On envy-free cake division
On envy-free cake division
โœ Steven J Brams; Alan D Taylor ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 234 KB
On finding dissimilar Pareto-optimal pat
On finding dissimilar Pareto-optimal paths
โœ Paolo Dell'Olmo; Monica Gentili; Andrea Scozzari ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 327 KB
An Algorithm For Super Envy-Free Cake Di
An Algorithm For Super Envy-Free Cake Division
โœ William A. Webb ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 720 KB

The standard mathematical setting for fair division problems begins with a cake X which is a compact subset of some Euclidean space and n players P,, . . . ,el each with an additive nonatomic probability measure p,,. . . , p,, on a a-algebra of measureable subsets of X , and asks for a partition { X