activity
20032026
most citedStopping games in continuous time

5 citations · 10 across the 21 of their papers we have counts for

collaborators

29 papers

cs.LG2026

Constant regret in general games via higher-order optimism

Omar Abbadi, Rida Laraki, Panayotis Mertikopoulos

We introduce an uncoupled learning algorithm which, when employed by all players of an arbitrary -player normal form game with up to actions per player, guarantees $O(N^3\lo…

cs.GT2026

What preferences can - and cannot - predict in multi-agent online learning

Omar Abbadi, Rida Laraki, Panayotis Mertikopoulos

We examine the interplay between ordinal, preference-based solution concepts in games and the long-run behavior of game dynamics, asking in particular to what extent the combinator…

cs.GT2026

Threshold Dynamics and Correlated Prophet Inequalities

José Correa, Maximilian Fichtl, Reda Jlibene +4

Prophet inequalities have become a central tool for analyzing the performance of online algorithms. However, most existing results assume that input random variables are independen…

cs.GT2026

A Unified Framework for Weighted Hypergraphic Networks and Fractional Matching

Rémi Castera, Julien Fixary, Rida Laraki

Network formation theory studies how agents create and maintain relationships, and the stability of those relationships with respect to individual incentives. A central stability c…

cs.GT2025

Selling Privacy in Blockchain Transactions

Georgios Chionas, Olga Gorelkina, Piotr Krysta +1

We study methods to enhance statistical privacy in blockchain transactions. We analyze economic mechanisms for privacy-aware transaction owners whose utility depends not only on th…

cs.GT2024

BAR Nash Equilibrium and Application to Blockchain Design

Maxime Reynouard, Rida Laraki, Olga Gorelkina

This paper presents a novel solution concept, called BAR Nash Equilibrium (BARNE) and apply it to analyse the Verifier's dilemma, a fundamental problem in blockchain. Our solution…