Almost envy-free allocations with connected bundles
From MaRDI portal
Publication:2078044
DOI10.1016/j.geb.2021.11.006zbMath1483.91102arXiv1808.09406MaRDI QIDQ2078044
Ayumi Igarashi, Dominik Peters, William S. Zwicker, Cosimo Vinci, Vittorio Bilò, Ioannis Caragiannis, Gianpiero Monaco, Michele Flammini
Publication date: 25 February 2022
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.09406
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
91A68: Algorithmic game theory and complexity
Related Items
The Price of Connectivity in Fair Division, Fair division of graphs and of tangled cakes, Fairly taking turns, Mind the gap: cake cutting with separation, Two-person fair division of indivisible items when envy-freeness is impossible, Envy-free allocations respecting social networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Allocating contiguous blocks of indivisible chores fairly
- Envy-free cake division without assuming the players prefer nonempty pieces
- 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
- Approximation Algorithms for Computing Maximin Share Allocations
- Fair Enough
- Algorithmic Solutions for Envy-Free Cake Cutting
- Maximin Share Allocations on Cycles
- Cake Cutting Algorithms
- The Approximation of Fixed Points of a Continuous Mapping
- Fairly allocating contiguous blocks of indivisible items
