Pages that link to "Item:Q5146918"
From MaRDI portal
The following pages link to Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol (Q5146918):
Displaying 5 items.
- Thou shalt covet the average of thy neighbors' cakes (Q2680239) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- A Note on a Cake Cutting Algorithm of Banach and Knaster (Q4339332) (← links)
- A discrete and bounded locally envy-free cake cutting protocol on trees (Q6609151) (← links)
- Approximate envy-freeness in graphical cake cutting (Q6611013) (← links)