On the existence of equitable cake divisions
From MaRDI portal
Publication:2510174
DOI10.1016/J.INS.2012.11.024zbMATH Open1293.91102OpenAlexW2002716108MaRDI QIDQ2510174FDOQ2510174
Eva Pillárová, Jozef Doboš, Katarina Cechlárová
Publication date: 1 August 2014
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2012.11.024
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Extremal set theory (05D05)
Cited In (13)
- Cake cutting: explicit examples for impossibility results
- Equitable Candy Sharing
- On a method of obtaining exact fair divisions
- Resource-monotonicity and population-monotonicity in connected cake-cutting
- Approximate envy-freeness in graphical cake cutting
- Existence of a simple and equitable fair division: a short proof
- Allocating contiguous blocks of indivisible chores fairly
- Fairly allocating contiguous blocks of indivisible items
- Dividing connected chores fairly
- Dividing a graphical cake
- Simple fair division of a square
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
- Mind the gap: cake cutting with separation
This page was built for publication: On the existence of equitable cake divisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2510174)