Stratis Skoulakis

Orcid: 0000-0003-3419-1776

Affiliations:
  • Singapore University of Technology and Design (SUTD), Singapore
  • National Technical University of Athens, School of Electrical and Computer Engineering, Greece


According to our database1, Stratis Skoulakis authored at least 30 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games.
CoRR, 2024

2023
Opinion Dynamics with Limited Information.
Algorithmica, December, 2023

Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction Maps.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Exponential Lower Bounds for Fictitious Play in Potential Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Efficient Online Clustering with Moving Costs.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Alternation makes the adversary weaker in two-player games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Maximum Independent Set: Self-Training through Dynamic Programming.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Semi Bandit dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees.
Proceedings of the International Conference on Machine Learning, 2023

STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Reallocating multiple facilities on the line.
Theor. Comput. Sci., 2021

Optimal No-Regret Learning in General Games: Bounded Regret with Unbounded Step-Sizes via Clairvoyant MWU.
CoRR, 2021

The complexity of constrained min-max optimization.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Online Learning in Periodic Zero-Sum Games.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Efficient Online Learning for Dynamic k-Clustering.
Proceedings of the 38th International Conference on Machine Learning, 2021

On the Approximability of Multistage Min-Sum Set Cover.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Transaction Fees on a Honeymoon: Ethereum's EIP-1559 One Month Later.
Proceedings of the 2021 IEEE International Conference on Blockchain, 2021

Dynamical analysis of the EIP-1559 Ethereum fee market.
Proceedings of the AFT '21: 3rd ACM Conference on Advances in Financial Technologies, Arlington, Virginia, USA, September 26, 2021

Evolutionary Game Theory Squared: Evolving Agents in Endogenously Evolving Zero-Sum Games.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Estimating the Number of Induced Subgraphs from Incomplete Data and Neighborhood Queries.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Convergence to Second-Order Stationarity for Non-negative Matrix Factorization: Provably and Concurrently.
CoRR, 2020

Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

The Online Min-Sum Set Cover Problem.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Natural and efficient dynamics through convex optimization
PhD thesis, 2019

Opinion Formation Games with Aggregation and Negative Influence.
Theory Comput. Syst., 2019

Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games.
CoRR, 2019

2016
Opinion Dynamics with Local Interactions.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016


  Loading...