Pages that link to "Item:Q4698451"
From MaRDI portal
The following pages link to An Envy-Free Cake Division Protocol (Q4698451):
Displayed 16 items.
- How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\) (Q439239) (← links)
- Extensions of cut-and-choose fair division (Q677613) (← links)
- On envy-free cake division (Q1347261) (← links)
- How to cut a cake fairly using a minimal number of cuts (Q1356520) (← links)
- Maximin share and minimax envy in fair-division problems. (Q1399324) (← links)
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond (Q1763188) (← links)
- Old and new moving-knife schemes (Q1903417) (← links)
- An algorithm for super envy-free cake division (Q1961037) (← links)
- Two-player envy-free multi-cake division (Q2270332) (← links)
- Computer science and decision theory (Q2271874) (← links)
- A paradoxical Pareto frontier in the cake-cutting context (Q2573268) (← links)
- Decision making beyond arrow's “impossibility theorem,” with the analysis of effects of collusion and mutual attraction (Q3600673) (← links)
- Cutting a Cake for Five People (Q3638457) (← links)
- On the possibilities for partitioning a cake (Q3837575) (← links)
- A moving-knife solution to the four-person envy-free cake-division problem (Q4332981) (← links)
- Preference Relations and Measures in the Context of Fair Division (Q4845929) (← links)