default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorgios Piliouras
- > Home > Persons > Georgios Piliouras
Publications
- 2025
[j22]Francisca Vasconcelos, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Panayotis Mertikopoulos
, Georgios Piliouras, Michael I. Jordan:
A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games. Quantum 9: 1737 (2025)- [i113]Fivos Kalogiannis, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Ian Gemp, Georgios Piliouras:
Solving Zero-Sum Convex Markov Games. CoRR abs/2506.16120 (2025) - 2023
- [c88]Iosif Sakos, Emmanouil V. Vlatakis-Gkaragkounis, Panayotis Mertikopoulos, Georgios Piliouras:
Exploiting hidden structures in non-convex games for convergence to Nash equilibrium. NeurIPS 2023 - [i88]Emmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Georgios Piliouras:
Chaos persists in large-scale multi-agent learning despite adaptive learning rates. CoRR abs/2306.01032 (2023) - [i81]Francisca Vasconcelos, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Panayotis Mertikopoulos, Georgios Piliouras, Michael I. Jordan:
A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games. CoRR abs/2311.10859 (2023) - [i79]Iosif Sakos, Emmanouil V. Vlatakis-Gkaragkounis, Panayotis Mertikopoulos, Georgios Piliouras:
Exploiting hidden structures in non-convex games for convergence to Nash equilibrium. CoRR abs/2312.16609 (2023) - 2021
- [c56]Emmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Georgios Piliouras:
Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent. NeurIPS 2021: 2373-2386 - [i68]Lampros Flokas, Emmanouil V. Vlatakis-Gkaragkounis, Georgios Piliouras:
Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent. CoRR abs/2101.05248 (2021) - 2020
- [c46]Emmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Thanasis Lianeas, Panayotis Mertikopoulos, Georgios Piliouras:
No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix. NeurIPS 2020 - [i42]Lampros Flokas, Emmanouil V. Vlatakis-Gkaragkounis, Thanasis Lianeas, Panayotis Mertikopoulos, Georgios Piliouras:
No-regret learning and mixed Nash equilibria: They do not mix. CoRR abs/2010.09514 (2020) - 2019
- [c34]Emmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Georgios Piliouras:
Efficiently avoiding saddle points with zero order methods: No gradients required. NeurIPS 2019: 10066-10077 - [c33]Emmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Georgios Piliouras:
Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games. NeurIPS 2019: 10450-10461 - [i23]Lampros Flokas, Emmanouil V. Vlatakis-Gkaragkounis, Georgios Piliouras:
Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games. CoRR abs/1910.13010 (2019) - [i22]Lampros Flokas, Emmanouil V. Vlatakis-Gkaragkounis, Georgios Piliouras:
Efficiently avoiding saddle points with zero order methods: No gradients required. CoRR abs/1910.13021 (2019)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-08-21 01:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
