A constructive proof of a permutation-based generalization of Sperner's lemma
From MaRDI portal
Recommendations
- A constructive version of Sperner's lemma and Brouwer's fixed point theorem
- A proof of the Sperner lemma from the Brouwer fixed point theorem
- ORIENTABILITY OF PSEUDOMANIFOLD AND GENERALIZATIONS OF SPERNER'S LEMMA
- An aspect of Sperner's lemma as a fixed point theorem
- scientific article; zbMATH DE number 4004191
Cites work
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
- Equilibrium Points of Bimatrix Games
- Equilibrium in a discrete exchange economy with money
- On generalizing shapley's index theory to labelled pseudomanifolds
- On the Sperner lemma
- Orientation in Complementary Pivot Algorithms
- Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation
- The Approximation of Fixed Points of a Continuous Mapping
- The computation of fixed points and applications
- Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology
Cited in
(24)- Combinatorial integer labeling theorems on finite sets with applications
- A combinatorial lemma and its applications
- A direct proof of Shapley-Sperner's lemma based on the KKMS lemma
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications
- The additivity of the volume and Sperner's lemma
- Fair division and generalizations of Sperner- and KKM-type results
- Equilibrium in a discrete exchange economy with regional sub-economies
- KKM type theorems with boundary conditions
- A Sperner lemma complete for PPA
- scientific article; zbMATH DE number 3964633 (Why is no real title available?)
- Combinatorial formulae for multiple set-valued labellings
- Two-Part and k-Sperner Families: New Proofs Using Permutations
- Combinatorial Stokes formulae
- Existence of balanced simplices on polytopes.
- Democratic fair allocation of indivisible goods
- ORIENTABILITY OF PSEUDOMANIFOLD AND GENERALIZATIONS OF SPERNER'S LEMMA
- Logarithmic algorithms for fair division problems
- ENVY‐FREE DIVISION USING MAPPING DEGREE
- Topologizing Sperner's lemma
- A simple proof of a theorem of Schmerl and Trotter for permutations
- Almost envy-free allocations with connected bundles
- A constructive version of Sperner's lemma and Brouwer's fixed point theorem
- Equivalent forms of the Brouwer fixed point theorem. II.
- Almost envy-free allocations with connected bundles
This page was built for publication: A constructive proof of a permutation-based generalization of Sperner's lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120843)
