search result

Cover von The Complexity of Gradient Descent (Invited Talk)

The Complexity of Gradient Descent (Invited Talk)

Year: 2021
Media group: LIPIcs
Cover von A Faster Algorithm for Finding Tarski Fixed Points

A Faster Algorithm for Finding Tarski Fixed Points

Year: 2021
Media group: LIPIcs
Cover von Algorithmic Game Theory
9th International Symposium, SAGT 2016, Liverpool, UK, September 19 - 21, 2016, Proceedings
Search for this author
Year: 2016
Publisher: Heidelberg, Springer
Series: Lecture notes in computer science : ARCoSS; 9928
Media group: MONOGRAPHIE
Cover von Tree Polymatrix Games Are PPAD-Hard

Tree Polymatrix Games Are PPAD-Hard

Year: 2020
Media group: LIPIcs
Cover von Unique End of Potential Line

Unique End of Potential Line

Year: 2019
Media group: LIPIcs
Cover von Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents

Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents

Author: Weber, Simon
Year: 2024
Media group: LIPIcs
Cover von Reachability Switching Games

Reachability Switching Games

Year: 2018
Media group: LIPIcs
Cover von Equilibrium Computation; 8
pp. 73-88
Search for this author
Year: 2014
Publisher: Wadern, LZI
Count: 8
Media group: DAGSTUHL REPORT
OPEN V 11.1.0.0