Game-theoretic algorithms for fair and strongly fair cake division with entitlements
From MaRDI portal
Publication:4853044
DOI10.4064/cm-69-1-59-73zbMath0836.90146OpenAlexW1131404163MaRDI QIDQ4853044
Publication date: 3 December 1995
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/210327
(n)-person games, (n>2) (91A06) Measures on Boolean rings, measure algebras (28A60) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (5)
Cutting a cake for infinitely many guests ⋮ Old and new moving-knife schemes ⋮ An algorithm for super envy-free cake division ⋮ Cake-cutting with different entitlements: how many cuts are needed? ⋮ Mind the gap: cake cutting with separation
This page was built for publication: Game-theoretic algorithms for fair and strongly fair cake division with entitlements
