Recently, there is a surge of works that provide finite-time guarantees and characterize the tight sample complexity for finding Nash equilibria [1]}, [2]}, [3]}, [4]}, [5]}, [6]}, [7]}, [8]}.
These algorithms are all essentially centralized.
Below, we focus on comparisons with several recent works that propose decentralized algorithms and provide finite-time guarantees.
