Discrete Fixed Points: Models, Complexities, and Applications

DOI10.1287/moor.1110.0511zbMath1238.68065OpenAlexW2080018621MaRDI QIDQ2884294

Amin Saberi, Qi Qi, Jie Zhang, Xiaotie Deng

Publication date: 24 May 2012

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:f147538c-ca80-41e8-9677-53c24e1f70f4

zbMATH Keywords

computational complexitySperner's lemmafixed-point algorithmTucker's theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fixed points and coincidences in algebraic topology (55M20)

Related Items (4)

Unique end of potential line ⋮ Understanding PPA-completeness ⋮ Unique End of Potential Line ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents

This page was built for publication: Discrete Fixed Points: Models, Complexities, and Applications