The following pages link to On the complexity of cake cutting (Q2467132):
Displaying 12 items.
- A note on envy-free cake cutting with polynomial valuations (Q477590) (← links)
- The efficiency of fair division (Q692886) (← links)
- On the computability of equitable divisions (Q1926490) (← 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)
- How to share a cake with a secret agent (Q2334821) (← links)
- Cake cutting: explicit examples for impossibility results (Q2334852) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- Fair cake-cutting for imitative agents (Q2673785) (← links)
- A near equitable 2-person cake cutting algorithm (Q3145047) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q3448772) (← links)
- Fair Division (Q5150295) (← links)
