| No. | Title | Author | Year |
|---|---|---|---|
| 1 | A Faster Algorithm for Finding Tarski Fixed Points | Fearnley, John et al. | 2021 |
| 2 | The Complexity of Gradient Descent (Invited Talk) | Savani, Rahul | 2021 |
| 3 | Tree Polymatrix Games Are PPAD-Hard | Deligkas, Argyrios et al. | 2020 |
| 4 | Unique End of Potential Line | Fearnley, John et al. | 2019 |
| 5 | Reachability Switching Games | Fearnley, John et al. | 2018 |
| 6 | Equilibrium Computation (Dagstuhl Seminar 14342) | Megiddo, Nimrod et al. | 2014 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |