scientific article; zbMATH DE number 7559057
From MaRDI portal
Publication:5090386
DOI10.4230/LIPIcs.ITCS.2019.14MaRDI QIDQ5090386
William S. Zwicker, Michele Flammini, Gianpiero Monaco, Cosimo Vinci, Ioannis Caragiannis, Dominik Peters, Ayumi Igarashi, Vittorio Bilò
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Existence of EFX for two additive valuations ⋮ On Fair Division under Heterogeneous Matroid Constraints ⋮ Almost envy-freeness in group resource allocation ⋮ Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ Fairly allocating contiguous blocks of indivisible items ⋮ Envy-free cake division without assuming the players prefer nonempty pieces ⋮ Democratic fair allocation of indivisible goods ⋮ Closing Gaps in Asymptotic Fair Division ⋮ Fairly Allocating Many Goods with Few Queries ⋮ Almost envy-free allocations with connected bundles ⋮ On the number of almost envy-free allocations ⋮ Consensus Halving for Sets of Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A constructive proof of a permutation-based generalization of Sperner's lemma
- Computing an st-numbering
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
- Rental Harmony: Sperner's Lemma in Fair Division
- How to Cut A Cake Fairly
- Some Combinatorial Lemmas in Topology
- How to Cut a Cake Fairly
- A moving-knife solution to the four-person envy-free cake-division problem
- Algorithmic Solutions for Envy-Free Cake Cutting
- Cake Cutting Algorithms
- Fairly allocating contiguous blocks of indivisible items
This page was built for publication:
