default search action
Stratis Skoulakis
Person information
- affiliation: Singapore University of Technology and Design (SUTD), Singapore
- affiliation: National Technical University of Athens, School of Electrical and Computer Engineering, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c28]Ioannis Mavrothalassitis, Stratis Skoulakis, Leello Tadesse Dadi, Volkan Cevher:
Efficient Continual Finite-Sum Minimization. ICLR 2024 - [c27]Pol Puigdemont, Stratis Skoulakis, Grigorios Chrysos, Volkan Cevher:
Learning to Remove Cuts in Integer Linear Programming. ICML 2024 - [c26]Luca Viano, Stratis Skoulakis, Volkan Cevher:
Imitation Learning in Discounted Linear MDPs without exploration assumptions. ICML 2024 - [i24]Leello Tadesse Dadi, Ioannis Panageas, Stratis Skoulakis, Luca Viano, Volkan Cevher:
Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games. CoRR abs/2401.09628 (2024) - [i23]Luca Viano, Stratis Skoulakis, Volkan Cevher:
Imitation Learning in Discounted Linear MDPs without exploration assumptions. CoRR abs/2405.02181 (2024) - [i22]Ioannis Mavrothalassitis, Stratis Skoulakis, Leello Tadesse Dadi, Volkan Cevher:
Efficient Continual Finite-Sum Minimization. CoRR abs/2406.04731 (2024) - [i21]Pol Puigdemont, Stratis Skoulakis, Grigorios Chrysos, Volkan Cevher:
Learning to Remove Cuts in Integer Linear Programming. CoRR abs/2406.18781 (2024) - 2023
- [j3]Dimitris Fotakis, Anthimos Vardis Kandiros
, Vasilis Kontonis, Stratis Skoulakis:
Opinion Dynamics with Limited Information. Algorithmica 85(12): 3855-3888 (2023) - [c25]Constantinos Daskalakis, Noah Golowich, Stratis Skoulakis
STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games. COLT 2023: 5146-5198 - [c24]Ioannis Panageas, Stratis Skoulakis
Semi Bandit dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees. ICML 2023: 26904-26930 - [c23]Lorenzo Brusca, Lars C. P. M. Quaedvlieg, Stratis Skoulakis, Grigorios Chrysos, Volkan Cevher:
Maximum Independent Set: Self-Training through Dynamic Programming. NeurIPS 2023 - [c22]Volkan Cevher, Ashok Cutkosky, Ali Kavis, Georgios Piliouras, Stratis Skoulakis, Luca Viano:
Alternation makes the adversary weaker in two-player games. NeurIPS 2023 - [c21]Dimitris Christou, Stratis Skoulakis, Volkan Cevher:
Efficient Online Clustering with Moving Costs. NeurIPS 2023 - [c20]Ioannis Panageas, Nikolas Patris, Stratis Skoulakis, Volkan Cevher:
Exponential Lower Bounds for Fictitious Play in Potential Games. NeurIPS 2023 - [c19]Volkan Cevher
Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction Maps. SOSA 2023: 192-206 - [i20]Volkan Cevher, Georgios Piliouras, Ryann Sim, Stratis Skoulakis:
Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction Maps. CoRR abs/2301.03931 (2023) - [i19]Ioannis Panageas, Stratis Skoulakis, Luca Viano, Xiao Wang, Volkan Cevher
Semi Bandit Dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees. CoRR abs/2306.15543 (2023) - [i18]Ioannis Panageas, Nikolas Patris, Stratis Skoulakis, Volkan Cevher:
Exponential Lower Bounds for Fictitious Play in Potential Games. CoRR abs/2310.02387 (2023) - [i17]Lorenzo Brusca, Lars C. P. M. Quaedvlieg, Stratis Skoulakis, Grigorios G. Chrysos, Volkan Cevher:
Maximum Independent Set: Self-Training through Dynamic Programming. CoRR abs/2310.18672 (2023) - 2022
- [c18]Ali Kavis, Stratis Skoulakis, Kimon Antonakopoulos, Leello Tadesse Dadi, Volkan Cevher:
Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization. NeurIPS 2022 - [c17]Georgios Piliouras, Ryann Sim, Stratis Skoulakis:
Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update. NeurIPS 2022 - [c16]Georgios Piliouras, Lillian J. Ratliff, Ryann Sim, Stratis Skoulakis:
Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games. SAGT 2022: 383-399 - [i16]Georgios Piliouras, Lillian J. Ratliff, Ryann Sim, Stratis Skoulakis:
Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games. CoRR abs/2207.08426 (2022) - [i15]Constantinos Daskalakis, Noah Golowich, Stratis Skoulakis, Manolis Zampetakis
STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games. CoRR abs/2210.09769 (2022) - [i14]Ali Kavis, Stratis Skoulakis, Kimon Antonakopoulos, Leello Tadesse Dadi, Volkan Cevher:
Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization. CoRR abs/2211.01851 (2022) - 2021
- [j2]Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis, Philip Lazos, Stratis Skoulakis, Nikos Zarifis:
Reallocating multiple facilities on the line. Theor. Comput. Sci. 858: 13-34 (2021) - [c15]Dimitris Fotakis, Thanasis Pittas, Stratis Skoulakis
Estimating the Number of Induced Subgraphs from Incomplete Data and Neighborhood Queries. AAAI 2021: 4045-4053 - [c14]Stratis Skoulakis
Evolutionary Game Theory Squared: Evolving Agents in Endogenously Evolving Zero-Sum Games. AAAI 2021: 11343-11351 - [c13]Stefanos Leonardos
Dynamical analysis of the EIP-1559 Ethereum fee market. AFT 2021: 114-126 - [c12]Daniël Reijsbergen, Shyam Sridhar, Barnabé Monnot, Stefanos Leonardos
Transaction Fees on a Honeymoon: Ethereum's EIP-1559 One Month Later. Blockchain 2021: 196-204 - [c11]Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis
On the Approximability of Multistage Min-Sum Set Cover. ICALP 2021: 65:1-65:19 - [c10]Dimitris Fotakis, Georgios Piliouras, Stratis Skoulakis:
Efficient Online Learning for Dynamic k-Clustering. ICML 2021: 3396-3406 - [c9]Tanner Fiez, Ryann Sim, Stratis Skoulakis, Georgios Piliouras, Lillian J. Ratliff:
Online Learning in Periodic Zero-Sum Games. NeurIPS 2021: 10313-10325 - [c8]Constantinos Daskalakis, Stratis Skoulakis
The complexity of constrained min-max optimization. STOC 2021: 1466-1478 - [i13]Stefanos Leonardos, Barnabé Monnot, Daniël Reijsbergen, Stratis Skoulakis, Georgios Piliouras:
Dynamical Analysis of the EIP-1559 Ethereum Fee Market. CoRR abs/2102.10567 (2021) - [i12]Dimitris Fotakis, Georgios Piliouras, Stratis Skoulakis:
Efficient Online Learning for Dynamic k-Clustering. CoRR abs/2106.04336 (2021) - [i11]Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis:
On the Approximability of Multistage Min-Sum Set Cover. CoRR abs/2107.13344 (2021) - [i10]Daniël Reijsbergen, Shyam Sridhar, Barnabé Monnot, Stefanos Leonardos, Stratis Skoulakis, Georgios Piliouras:
Transaction Fees on a Honeymoon: Ethereum's EIP-1559 One Month Later. CoRR abs/2110.04753 (2021) - [i9]Tanner Fiez, Ryann Sim, Stratis Skoulakis, Georgios Piliouras, Lillian J. Ratliff:
Online Learning in Periodic Zero-Sum Games. CoRR abs/2111.03377 (2021) - [i8]Georgios Piliouras, Ryann Sim, Stratis Skoulakis:
Optimal No-Regret Learning in General Games: Bounded Regret with Unbounded Step-Sizes via Clairvoyant MWU. CoRR abs/2111.14737 (2021) - 2020
- [c7]Dimitris Fotakis
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. ICALP 2020: 50:1-50:19 - [c6]Dimitris Fotakis
The Online Min-Sum Set Cover Problem. ICALP 2020: 51:1-51:16 - [c5]Dimitris Fotakis, Thanasis Lianeas, Georgios Piliouras, Stratis Skoulakis:
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent. NeurIPS 2020 - [i7]Ioannis Panageas, Stratis Skoulakis, Antonios Varvitsiotis, Xiao Wang:
Convergence to Second-Order Stationarity for Non-negative Matrix Factorization: Provably and Concurrently. CoRR abs/2002.11323 (2020) - [i6]Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, Manolis Vardas:
The Online Min-Sum Set Cover Problem. CoRR abs/2003.02161 (2020) - [i5]Constantinos Daskalakis, Stratis Skoulakis, Manolis Zampetakis:
The Complexity of Constrained Min-Max Optimization. CoRR abs/2009.09623 (2020) - [i4]Dimitris Fotakis, Thanasis Lianeas, Georgios Piliouras, Stratis Skoulakis:
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent. CoRR abs/2011.02817 (2020) - [i3]Stratis Skoulakis, Tanner Fiez, Ryann Sim, Georgios Piliouras, Lillian J. Ratliff:
Evolutionary Game Theory Squared: Evolving Agents in Endogenously Evolving Zero-Sum Games. CoRR abs/2012.08382 (2020)
2010 – 2019
- 2019
- [b1]Stratis Skoulakis:
Natural and efficient dynamics through convex optimization. National Technical University of Athens, Greece, 2019 - [j1]Markos Epitropou, Dimitris Fotakis
Opinion Formation Games with Aggregation and Negative Influence. Theory Comput. Syst. 63(7): 1531-1553 (2019) - [c4]Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis, Philip Lazos, Stratis Skoulakis
Reallocating Multiple Facilities on the Line. IJCAI 2019: 273-279 - [i2]Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis, Philip Lazos, Stratis Skoulakis, Nikos Zarifis:
Reallocating Multiple Facilities on the Line. CoRR abs/1905.12379 (2019) - [i1]Dimitris Fotakis, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis:
Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games. CoRR abs/1911.08704 (2019) - 2018
- [c3]Dimitris Fotakis, Anthimos Vardis Kandiros, Vasilis Kontonis, Stratis Skoulakis:
Opinion Dynamics with Limited Information. WINE 2018: 282-296 - 2017
- [c2]Markos Epitropou, Dimitris Fotakis, Martin Hoefer, Stratis Skoulakis:
Opinion Formation Games with Aggregation and Negative Influence. SAGT 2017: 173-185 - 2016
- [c1]Dimitris Fotakis, Dimitris Palyvos-Giannas, Stratis Skoulakis:
Opinion Dynamics with Local Interactions. IJCAI 2016: 279-285
Coauthor Index
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 2024-09-04 00:32 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: