Logarithmic algorithms for fair division problems
DOI10.1137/22M1511564MaRDI QIDQ6654114
Alexandr Grebennikov, A. V. Malyutin, Xenia Isaeva, Oleg R. Musin, M. D. Mikhailov
Publication date: 18 December 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Sperner's lemmacake-cutting problemKKM lemmacomputational fair divisionenvy-free fair divisionrental harmony problem
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Title not available (Why is that?)
- Rental harmony with roommates
- Equilibrium in a discrete exchange economy with money
- Envy-free cake divisions cannot be found by finite protocols
- A constructive proof of a permutation-based generalization of Sperner's lemma
- Ein Beweis des Fixpunktsatzes für \(n\)-dimensionale Simplexe.
- KKM type theorems with boundary conditions
- Mind the gap: cake cutting with separation
- Homotopy invariants of covers and KKM-type lemmas
- Rental Harmony: Sperner's Lemma in Fair Division
- How to Cut A Cake Fairly
- How to Cut a Cake Fairly
- Fair Division and Generalizations of Sperner- and KKM-type Results
- Achieving Rental Harmony with a Secretive Roommate
- Algorithmic Solutions for Envy-Free Cake Cutting
- Sur la division pragmatique
This page was built for publication: Logarithmic algorithms for fair division problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654114)
