Ph.D. thesis titled 'Probabilistic Analysis for Caching', providing rigorous performance guarantees for probabilistic streaming and caching algorithms. The analysis uses Markov-process techniques, renewal theory, concentration inequalities, or online convex optimization to yield tight performance bounds.
Research Experience
Currently a postdoctoral researcher at the University of Avignon under the supervision of Francesco De Pellegrini and Eitan Altman. Postdoc work focuses on repeated games arising from the competition among agents in proportional allocation auctions.
Education
2020-2024, obtained a Ph.D. in Computer Science from Université Côte d’Azur and Inria Sophia Antipolis, supervised by Sara Alouf and Giovanni Neglia.
Background
Research interests include the application of probability theory to analyze randomized streaming and caching algorithms. Recently, started working on repeated resource allocation games.