Jason Chatzitheodorou

jason.jpg

PhD Student

Columbia University, New York

Hello, I’m Jason! I am a PhD student in the IEOR department of Columbia University, advised by Eric Balkanski. Prior to joining Columbia, I finished my undergraduate studies in the ECE department of the National Technical University of Athens where I was advised by Dimitris Fotakis.

I am generally interested in the areas of combinatorial and stochastic optimization, with a focus on beyond-worst-case analysis and decision-making under uncertainty. Some problems I am actively working on are stochastic online matching, online clustering and submodular maximization. During my undergraduate thesis I focused on algorithms with machine learning predictions.

Publications

2026

  1. ICALP
    On the Average-Case Performance of Greedy for Maximum Coverage
    Eric Balkanski, Jason Chatzitheodorou, and Flore Sentenac
    2026
  2. EC
    Online Min-Cost Matching with General Arrivals
    Josh Ascher, Eric Balkanski, Jason Chatzitheodorou, and Vasilis Gkatzelis
    2026
  3. arXiv
    The Knapsack Secretary Problem is Strictly Harder Than the Secretary Problem
    Eric Balkanski, Jason Chatzitheodorou, Dimitris Fotakis, and Thanos Tolias
    2026

2025

  1. ALT
    Cost-Free Fairness in Online Correlation Clustering
    Eric Balkanski, Jason Chatzitheodorou, and Andreas Maggiori
    2025

Awards

  1. Miller Fellowship: By Columbia for the 2023 Fall Semester
  2. The Great Moment for Education: By Eurobank for the highest grade in the nationwide “Panhellenic” exams among each high school in Greece