Pages that link to "Item:Q2936971"
From MaRDI portal
The following pages link to Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations (Q2936971):
Displaying 16 items.
- Fair and efficient cake division with connected pieces (Q776236) (← links)
- Truthful fair division without free disposal (Q826615) (← links)
- Resource-monotonicity and population-monotonicity in connected cake-cutting (Q1737122) (← links)
- Expand the shares together: envy-free mechanisms with a small number of cuts (Q1739119) (← links)
- Obvious manipulations in cake-cutting (Q2103594) (← links)
- Fairness and efficiency in cake-cutting with single-peaked preferences (Q2180735) (← links)
- Monotonicity and competitive equilibrium in cake-cutting (Q2323302) (← links)
- Fair cake-cutting for imitative agents (Q2673785) (← links)
- A Note on a Cake Cutting Algorithm of Banach and Knaster (Q4339332) (← links)
- Computing Large Market Equilibria Using Abstractions (Q5031015) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol (Q5146918) (← links)
- Constant factor approximation for balanced cut in the PIE model (Q5259537) (← links)
- Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts (Q6065412) (← links)
- Fairly taking turns (Q6148409) (← links)
- On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)