Cited By
View all- Fearnley JGoldberg PHollender ASavani R(2022)The Complexity of Gradient Descent: CLS = PPAD ∩ PLSJournal of the ACM10.1145/356816370:1(1-74)Online publication date: 19-Dec-2022
A Faster Algorithm for Finding Tarski Fixed Points
Article No.: 23, Pages 1 - 23
Abstract
Dang et al. have given an algorithm that can find a Tarski fixed point in a k-dimensional lattice of width n using O(log k n) queries [2]. Multiple authors have conjectured that this algorithm is optimal [2, 7], and indeed this has been proven for two-dimensional instances [7]. We show that these conjectures are false in dimension three or higher by giving an O(log2 n) query algorithm for the three-dimensional Tarski problem. We also give a new decomposition theorem for k-dimensional Tarski problems which, in combination with our new algorithm for three dimensions, gives an O(log2 ⌈k/3⌉ n) query algorithm for the k-dimensional problem.
References
[1]
Ching-Lueh Chang, Yuh-Dauh Lyuu, and Yen-Wu Ti. 2008. The complexity of Tarski’s fixed point theorem. Theor. Comput. Sci. 401, 1–3 (2008), 228–235.
[2]
Chuangyin Dang, Qi Qi, and Yinyu Ye. 2020. Computations and complexities of Tarski’s fixed points and supermodular games. CoRR abs/2005.09836 (2020). Stanford Tech Report version appeared in 2012.
[3]
Chuangyin Dang and Yinyu Ye. 2018. On the Complexity of a Class of Discrete Fixed Point Problems Under the Lexicographic Ordering. Technical Report. City University of Hong Kong, CY2018-3, 17 pages.
[4]
Chuangyin Dang and Yinyu Ye. 2018. On the complexity of an expanded Tarski’s fixed point problem under the componentwise ordering. Theor. Comput. Sci. 732 (2018), 26–45.
[5]
Chuangyin Dang and Yinyu Ye. 2020. Erratum/correction to “On the complexity of an expanded Tarski’s fixed point problem under the componentwise ordering” [Theor. Comput. Sci. 732 (2018) 26–45]. Theor. Comput. Sci. 817 (2020), 80.
[6]
Federico Echenique. 2007. Finding all equilibria in games of strategic complements. J. Econ. Theory 135, 1 (2007), 514–532.
[7]
Kousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, and Mihalis Yannakakis. 2020. Tarski’s theorem, supermodular games, and the complexity of equilibria. In Proc. of ITCS, Vol. 151. 18:1–18:19.
[8]
John Fearnley, Paul W. Goldberg, Alexandros Hollender, and Rahul Savani. 2021. The complexity of gradient descent: CLS = PPAD \(\cap\) PLS. In Proc. of STOC. 46–59.
[9]
John Fearnley, Spencer Gordon, Ruta Mehta, and Rahul Savani. 2020. Unique end of potential line. J. Comput. Syst. Sci. 114 (2020), 1–35.
[10]
John Fearnley and Rahul Savani. 2021. A faster algorithm for finding Tarski fixed points. In Proc. of STACS. 29:1–29:16.
[11]
Paul Milgrom and John Roberts. 1990. Rationalizability, learning, and equilibrium in games with strategic complementarities. Econometrica 58, 6 (1990), 1255–1277.
[12]
Alfred Tarski. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5, 2 (1955), 285–309.
[13]
Donald M. Topkis. 1979. Equilibrium points in nonzero-sum n-person submodular games. SIAM J. Control Optim 17 (1979), 773–787.
[14]
Donald M. Topkis. 1998. Supermodularity and Complementarity. Princeton University Press.
Index Terms
- A Faster Algorithm for Finding Tarski Fixed Points
Recommendations
Improved Upper Bounds for Finding Tarski Fixed Points
EC '22: Proceedings of the 23rd ACM Conference on Economics and ComputationWe study the query complexity of finding a Tarski fixed point over the k-dimensional grid {1,...,n}k. Improving on the previous best upper bound of O(log⌈2k/3⌉n)[7], we give a new algorithm with query complexity O(log⌈(k+1)/2⌉n). This is based on a ...
Reducing Tarski to Unique Tarski (In the Black-Box Model)
CCC '23: Proceedings of the conference on Proceedings of the 38th Computational Complexity ConferenceWe study the problem of finding a Tarski fixed point over the k-dimensional grid [n]k. We give a black-box reduction from the Tarski problem to the same problem with an additional promise that the input function has a unique fixed point. It implies ...
Complete and atomic Tarski algebras
AbstractTarski algebras, also known as implication algebras or semi-boolean algebras, are the $$\left\{ \rightarrow \right\} $$-subreducts of Boolean algebras. In this paper we shall introduce and study the complete and atomic Tarski algebras. We shall ...
Comments
Information & Contributors
Information
Published In
July 2022
314 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 October 2022
Online AM: 17 March 2022
Accepted: 02 February 2022
Received: 15 June 2021
Published in TALG Volume 18, Issue 3
Check for updates
Author Tags
Qualifiers
- Research-article
- Refereed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 295Total Downloads
- Downloads (Last 12 months)109
- Downloads (Last 6 weeks)13
Reflects downloads up to 03 Sep 2024
Other Metrics
Citations
Cited By
View all- Fearnley JGoldberg PHollender ASavani R(2022)The Complexity of Gradient Descent: CLS = PPAD ∩ PLSJournal of the ACM10.1145/356816370:1(1-74)Online publication date: 19-Dec-2022
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderFull Text
View this article in Full Text.
Full TextHTML Format
View this article in HTML Format.
HTML Format