5 citations · 10 across the 21 of their papers we have counts for
14 papers · 1 filter
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…
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…
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…
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…
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…
O'Neill's Theorem for Games
Srihari Govindan, Rida Laraki, Lucas Pahl
We present an analog of O'Neill's Theorem (Theorem 5.2 in [17]) for finite games, which reveals some of the structure of equilibria under payoff perturbations in finite games.