Almost envy-free allocations with connected bundles
Authors:
- Vittorio BilòVBVittorio Bilò
- Ioannis CaragiannisICIoannis Caragiannis
- Michele FlamminiMFMichele Flammini
- Ayumi IgarashiAIAyumi Igarashi
- Gianpiero MonacoGianpiero Monaco
- Dominik PetersDPDominik Peters
- Cosimo VinciCVCosimo Vinci
- William S. ZwickerWZWilliam S. Zwicker
- 1 January 2022
- journal article
- research article
- Published by Elsevier in Games and Economic Behavior
- Vol. 131, 197-221
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Algorithmic Solutions for Envy-Free Cake CuttingOperations Research, 2012
- The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal IncomesJournal of Political Economy, 2011
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyondMathematical Social Sciences, 2004
- Rental Harmony: Sperner's Lemma in Fair DivisionThe American Mathematical Monthly, 1999
- A constructive proof of a permutation-based generalization of Sperner's lemmaMathematical Programming, 1989
- Chapter 21 The computation of equilibrium prices: An exposition1982
- Computing an st-numberingTheoretical Computer Science, 1976
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- The Approximation of Fixed Points of a Continuous MappingSIAM Journal on Applied Mathematics, 1967
- How to Cut A Cake FairlyThe American Mathematical Monthly, 1961