A faster algorithm for finding Tarski fixed points

DOI10.4230/LIPICS.STACS.2021.29MaRDI QIDQ7231552zbMATH OpenFDO

Authors John Fearnley, Rahul Savani

Publication date 21 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2021.29

zbMATH Keywords

query complexityTarski fixed pointstotal function problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• Equilibrium Points in Nonzero-Sum n-Person Submodular Games
• Finding all equilibria in games of strategic complements
• On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
• Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities
• Tarski's theorem, supermodular games, and the complexity of equilibria
• The complexity of Tarski's fixed point theorem
• Unique end of potential line

This page was built for publication: A faster algorithm for finding Tarski fixed points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231552)