Envy-free division via configuration spaces

DOI10.12775/TMNA.2022.036MaRDI QIDQ6044500zbMATH OpenOpenAlexFDO

Authors G. Panina, Rade Živaljević

Publication date 19 May 2023

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

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

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)

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.

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

Cites work

• A geometric approach to a class of equilibrium existence theorems
• Achieving rental harmony with a secretive roommate
• Chessboard complexes indomitable
• Dividing a cake fairly
• ENVY‐FREE DIVISION USING MAPPING DEGREE
• Envy-free cake division without assuming the players prefer nonempty pieces
• Equilibrium in a discrete exchange economy with money
• Existence of equilibrium with incomplete markets
• Fair distributions for more participants than allocations
• How to Cut a Cake Fairly
• On a topological generalization of the Tverberg theorem
• Optimal bounds for the colored Tverberg problem
• Simple proofs of some Borsuk-Ulam results
• Splitting necklaces
• Splitting necklaces, with constraints
• The colored Tverberg's problem and complexes of injective functions
• 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

Cited in

(4)

• Vanishing of all equivariant obstructions and the mapping degree
• Envy-free division in the presence of a dragon
• scientific article; zbMATH DE number 6850473 (Why is no real title available?)
• ENVY‐FREE DIVISION USING MAPPING DEGREE

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)