Pages that link to "Item:Q5130002"
From MaRDI portal
The following pages link to Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002):
Displaying 12 items.
- Truthful fair division without free disposal (Q826615) (← links)
- Mind the gap: cake cutting with separation (Q2093384) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Fair multi-cake cutting (Q2659057) (← links)
- A Note on a Cake Cutting Algorithm of Banach and Knaster (Q4339332) (← links)
- How to Cut a Cake Fairly: A Generalization to Groups (Q5144503) (← links)
- Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol (Q5146918) (← links)
- Fair Cake Division Under Monotone Likelihood Ratios (Q5868939) (← links)
- Fairly allocating contiguous blocks of indivisible items (Q5894699) (← links)
- On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)
- Approximate envy-freeness in graphical cake cutting (Q6611013) (← links)
- Dividing a graphical cake (Q6668347) (← links)