Envy-free division via configuration spaces

DOI10.12775/TMNA.2022.036zbMATH Open1514.91071arXiv2102.06886OpenAlexW3132224482MaRDI QIDQ6044500FDOQ6044500

Authors: G. Panina, Rade Živaljević 

Publication date: 19 May 2023

Published in: Topological Methods in Nonlinear Analysis (Search for Journal in Brave)

Abstract: The classical approach to envy-free division and equilibrium problems relies on Knaster-Kuratowski-Mazurkiewicz theorem, Sperner's lemma or some extension involving mapping degree. We propose a different and relatively novel approach where the emphasis is on configuration spaces and equivariant topology. We illustrate the method by proving several relatives (extensions) of the classical envy-free division theorem of David Gale, where the emphasis is on preferences allowing the players to choose degenerate pieces of the cake.

Full work available at URL: https://arxiv.org/abs/2102.06886

Recommendations

• ENVY‐FREE DIVISION USING MAPPING DEGREE
• Envy-free divisions
• Envy-free division in the presence of a dragon
• Envy-free cake division without assuming the players prefer nonempty pieces
• Envy-free division of discrete cakes

zbMATH Keywords

envy-free divisionconfiguration space/test map scheme

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Fixed points and coincidences in algebraic topology (55M20) Discriminantal varieties and configuration spaces in algebraic topology (55R80)

Cites Work

• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• Simple proofs of some Borsuk-Ulam results
• Splitting necklaces
• Equilibrium in a discrete exchange economy with money
• The colored Tverberg's problem and complexes of injective functions
• On a topological generalization of the Tverberg theorem
• Optimal bounds for the colored Tverberg problem
• How to Cut a Cake Fairly
• Chessboard complexes indomitable
• A geometric approach to a class of equilibrium existence theorems
• Existence of equilibrium with incomplete markets
• Dividing a cake fairly
• Envy-free cake division without assuming the players prefer nonempty pieces
• ENVY‐FREE DIVISION USING MAPPING DEGREE
• Splitting necklaces, with constraints
• Achieving rental harmony with a secretive roommate
• Fair distributions for more participants than allocations

Cited In (4)

• Envy-free division in the presence of a dragon
• Vanishing of all equivariant obstructions and the mapping degree
• ENVY‐FREE DIVISION USING MAPPING DEGREE
• Title not available (Why is that?)

This page was built for publication: Envy-free division via configuration spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6044500)