A note on cake cutting
From MaRDI portal
Cites work
Cited in
(40)- How to cut a cake fairly using a minimal number of cuts
- A pie allocation among sharing groups
- Practical verification of multi-agent systems against \textsc{Slk} specifications
- Resource-monotonicity and population-monotonicity in connected cake-cutting
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
- Approximating fair division with a limited number of cuts
- On the computability of equitable divisions
- An algorithm for super envy-free cake division
- Mind the gap: cake cutting with separation
- Obvious manipulations in cake-cutting
- Fair division of mixed divisible and indivisible goods
- Computer science and decision theory
- Fair cake-cutting among families
- How to share a cake with a secret agent
- Cake cutting: explicit examples for impossibility results
- Fair and square: cake-cutting in two dimensions
- On the complexity of cake cutting
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
- Fair multi-cake cutting
- Fair allocation of indivisible goods: beyond additive valuations
- Fair cake-cutting in practice
- Thou shalt covet the average of thy neighbors' cakes
- Cutting a Cake for Five People
- Fair Division
- Envy-free matchings in bipartite graphs and their applications to fair division
- On existence of truthful fair cake cutting mechanisms
- Maximize egalitarian welfare for cake cutting
- Fair division with allocator's preference
- Extensions of cut-and-choose fair division
- Fair division with prioritized agents
- Between proportionnality and envy-freeness: k-proportionality
- Proportional allocations of multi-layered cakes
- The efficiency of fair division
- Differentially private fair division
- The circular balancing problem
- Almost envy-free allocation of indivisible goods: a tale of two valuations
- Logarithmic comparison-based query complexity for fair division of indivisible goods
- Fairer than fair: sharp bounds for connected super-proportional cake cutting
- Envy-free cake cutting: a polynomial number of queries with high probability
- Which is the fairest allocation in the max-min fairness-based coalitional game?
This page was built for publication: A note on cake cutting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q595538)
