On a method of obtaining exact fair divisions

DOI10.14708/ma.v46i2.5134zbMath1463.91066OpenAlexW2907266351WikidataQ128653352 ScholiaQ128653352MaRDI QIDQ5135651

Jerzy Legut

Publication date: 23 November 2020

Published in: Mathematica Applicanda (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14708/ma.v46i2.5134

zbMATH Keywords

algorithmscake cuttingexact fair division

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Splitting necklaces
• On envy-free cake division
• Old and new moving-knife schemes
• On the computability of equitable divisions
• On the existence of equitable cake divisions
• A near equitable 2-person cake cutting algorithm
• How to Cut A Cake Fairly
• How to Cut a Cake Fairly
• Fair Division and Generalizations of Sperner- and KKM-type Results
• An Envy-Free Cake Division Protocol
• Optimal Fair Division for Measures with Piecewise Linear Density Functions
• A Moment Problem in L 1 Approximation
• Sur la division pragmatique

This page was built for publication: On a method of obtaining exact fair divisions