Iasonas Nikolaou

Iasonas Nikolaou

Auto-generated profile, based on publicly available information

Iasonas Nikolaou

Boston University Boston MA USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 February 2024 in arXiv
Verified
Preprint
Open access
PDF file
INIasonas Nikolaou
Iasonas Nikolaou
KPKonstantinos Pelechrinis
Konstantinos Pelechrinis
ETEvimaria Terzi
Evimaria Terzi
In this work, we develop a graphical model to capture team dynamics. We analyze the model and show how to learn its parameters from data. Using our model we study the phenomenon of team collapse from a computational perspective. We use simulations and real-world experiments to find the main causes of team collapse. We also provide the principles of building resilient teams, i.e., teams that avoid collapsing. Finally, we use our model to analyze the structure of NBA teams and dive deeper into games of interest.

8 January 2024 in arXiv
Verified
Preprint
Open access
PDF file
TSTareq Si Salem
Tareq Si Salem
GÖGözde Özcan
Gözde Özcan
INIasonas Nikolaou
Iasonas Nikolaou
ETEvimaria Terzi
Evimaria Terzi
SIStratis Ioannidis
Stratis Ioannidis
We study monotone submodular maximization under general matroid constraints in the online setting. We prove that online optimization of a large class of submodular functions, namely, weighted threshold potential functions, reduces to online convex optimization (OCO). This is precisely because functions in this class admit a concave relaxation; as a result, OCO policies, coupled with an appropriate rounding scheme, can be used to achieve sublinear regret in the combinatorial setting. We show that our reduction extends to many different versions of the online learning problem, including the dynamic regret, bandit, and optimistic-learning settings.

22 October 2025 in arXiv
Verified
Preprint
Open access
PDF file
INIasonas Nikolaou
Iasonas Nikolaou
MSMiltiadis Stouras
Miltiadis Stouras
SIStratis Ioannidis
Stratis Ioannidis
ETEvimaria Terzi
Evimaria Terzi
Given a collection of monotone submodular functions, the goal of Two-Stage Submodular Maximization (2SSM) [Balkanski et al., 2016] is to restrict the ground set so an objective selected u.a.r. from the collection attains a high maximal value, on average, when optimized over the restricted ground set. We introduce the Online Two-Stage Submodular Maximization (O2SSM) problem, in which the submodular objectives are revealed in an online fashion. We study this problem for weighted threshold potential functions, a large and important subclass of monotone submodular functions that includes influence maximization, data summarization, and facility location, to name a few. We design an algorithm that achieves sublinear $(1 - 1/e)^2$-regret under general matroid constraints and $(1 - 1/e)(1-e^{-k}k^k/k!)$-regret in the case of uniform matroids of rank $k$; the latter also yields a state-of-the-art bound for the (offline) 2SSM problem. We empirically validate the performance of our online algorithm with experiments on real datasets.