Sperner’s Colorings and Optimal Partitioning of the Simplex

DOI10.1007/978-3-319-44479-6_25zbMath1384.05188arXiv1611.08339OpenAlexW2558183505MaRDI QIDQ4604392

Maryam Mirzakhani, Jan Vondrák

Publication date: 26 February 2018

Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

separating setSperner's lemmaVoronoi partition

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of simplicial complexes (05E45)

Related Items (2)

A tour through Mirzakhani’s work on moduli spaces of Riemann surfaces ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

Cites Work

• A polytopal generalization of Sperner's lemma
• Non-cooperative games
• Rental Harmony: Sperner's Lemma in Fair Division
• Submodular Cost Allocation Problem and Applications
• Settling the complexity of computing two-player Nash equilibria
• Approximation algorithms for classification problems with pairwise relationships
• The Complexity of Computing a Nash Equilibrium
• Sperner's Colorings, Hypergraph Labeling Problems and Fair Division
• Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Sperner’s Colorings and Optimal Partitioning of the Simplex