Pages that link to "Item:Q1961037"
From MaRDI portal
The following pages link to An algorithm for super envy-free cake division (Q1961037):
Displaying 6 items.
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- How to cut a cake with a Gram matrix (Q1625485) (← links)
- Super envy-free cake division and independence of measures (Q1916698) (← links)
- Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm (Q3115855) (← links)
- Meta-Envy-Free Cake-Cutting Protocols (Q3586108) (← links)
- Envy-free division of discrete cakes (Q5920328) (← links)