3 citations · 10 across the 24 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2020
The Complexity of Constrained Min-Max Optimization
Constantinos Daskalakis, Stratis Skoulakis, Manolis Zampetakis
Despite its important applications in Machine Learning, min-max optimization of nonconvex-nonconcave objectives remains elusive. Not only are there no known first-order methods con…
cs.CC2019
Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games
Dimitris Fotakis, Vardis Kandiros, Thanasis Lianeas +3
In this work, we seek a more refined understanding of the complexity of local optimum computation for Max-Cut and pure Nash equilibrium (PNE) computation for congestion games with…