Approximate envy-freeness in graphical cake cutting

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Rental Harmony: Sperner's Lemma in Fair Division
How to Cut A Cake Fairly
Cake Cutting Algorithms
On the minimum diameter spanning tree problem
How to Cut a Cake Fairly
On the existence of equitable cake divisions
Envy-free cake divisions cannot be found by finite protocols
On the uniform edge-partition of a tree
A tight bound on the min-ratio edge-partitioning problem of a tree
A discrete and bounded envy-free cake cutting protocol for four agents
Fairly allocating contiguous blocks of indivisible items
Fair and efficient cake division with connected pieces
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
On the computability of equitable divisions
A linear-time algorithm for finding an edge-partition with max-min ratio at most two
Almost envy-free allocations with connected bundles
Maximin Share Allocations on Cycles
Mind the gap: cake cutting with separation
The Price of Connectivity in Fair Division
Closing Gaps in Asymptotic Fair Division
How to Cut a Cake Fairly: A Generalization to Groups
Cutting a Cake Fairly for Groups Revisited
Thou shalt covet the average of thy neighbors' cakes
Parameterized complexity of envy-free resource allocation in social networks
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
Fair division of graphs and of tangled cakes
A discrete and bounded locally envy-free cake cutting protocol on trees
Approximation algorithms for envy-free cake division with connected pieces

Cited In (1)

Dividing a graphical cake

This page was built for publication: Approximate envy-freeness in graphical cake cutting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611013)