activity
20192025
most citedOnline Learning for Min Sum Set Cover and Pandora's Box

5 citations · 13 across the 6 of their papers we have counts for

collaborators

12 papers

cs.DS2025

The Role of Commitment in Optimal Stopping

José Correa, Evangelia Gergatsouli, Bruno Ziliotto

We investigate the role of commitment in optimal stopping by studying all the variants between Prophet Inequality (PI) and Pandora's Box (PB). Both problems deal with a set of vari…

cs.DS2025

Online Combinatorial Optimization with Graphical Dependencies

Zhimeng Gao, Evangelia Gergatsouli, Kalen Patton +1

Most existing work in online stochastic combinatorial optimization assumes that inputs are drawn from independent distributions -- a strong assumption that often fails in practice.…

cs.GT2023★ 1 cited

Prophet Secretary Against the Online Optimal

Paul Dütting, Evangelia Gergatsouli, Rojin Rezvan +2

We study the prophet secretary problem, a well-studied variant of the classic prophet inequality, where values are drawn from independent known distributions but arrive in uniforml…

cs.DS2023

Weitzman's Rule for Pandora's Box with Correlations

Evangelia Gergatsouli, Christos Tzamos

Pandora's Box is a central problem in decision making under uncertainty that can model various real life scenarios. In this problem we are given boxes, each with a fixed openin…

cs.DS2022

Graph Connectivity with Noisy Queries

Dimitris Fotakis, Evangelia Gergatsouli, Charilaos Pipis +2

Graph connectivity is a fundamental combinatorial optimization problem that arises in many practical applications, where usually a spanning subgraph of a network is used for its op…

cs.LG2022★ 4 cited

Contextual Pandora's Box

Alexia Atsidakou, Constantine Caramanis, Evangelia Gergatsouli +2

Pandora's Box is a fundamental stochastic optimization problem, where the decision-maker must find a good alternative while minimizing the search cost of exploring the value of eac…