DC FieldValueLanguage
dc.contributor.authorPanina, Gaianeen_US
dc.contributor.authorŽivaljević, Radeen_US
dc.date.accessioned2023-06-08T11:51:27Z-
dc.date.available2023-06-08T11:51:27Z-
dc.date.issued2023-
dc.identifier.issn1230-3429-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/5059-
dc.description.abstractThe classical approach to envy-free division and equilibrium problems arising in mathematical economics typically 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, originally developed for applications in discrete and computational geometry (Tverberg type problems, necklace splitting problem, etc.). We illustrate the method by proving several counterparts and 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.en_US
dc.publisherJuliusz Schauder Center for Nonlinear Analysisen_US
dc.relation.ispartofTopological Methods in Nonlinear Analysisen_US
dc.subjectconfiguration space/test map scheme | Envy-free divisionen_US
dc.titleENVY-FREE DIVISION VIA CONFIGURATION SPACESen_US
dc.typeArticleen_US
dc.identifier.doi10.12775/TMNA.2022.036-
dc.identifier.scopus2-s2.0-85159919169-
dc.contributor.affiliationMechanicsen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.relation.firstpage83-
dc.relation.lastpage106-
dc.relation.issue1-
dc.relation.volume61-
dc.description.rank~M22-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-9801-8839-
Show simple item record

Page view(s)

31
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.