activity
20072026
most citedConstrained Consensus

2.2k citations · 4.1k across the 118 of their papers we have counts for

collaborators

130 papers

stat.ML2026

Taylor Representations for Model-Free RL in Networked MDPs

Salah Chikhi, Abdelhaq Chaoui, Asuman Ozdaglar +1

In Networked Markov Decision Processes, transition dynamics are often unknown and the state--action space grows rapidly with the number of agents. In this setting, Taylor represent…

cs.LG2026

Constant Individual Regret in General Games

Mingyang Liu, Gabriele Farina, Asuman Ozdaglar

Uncoupled no-regret dynamics provide a decentralized route to equilibrium, but prior guarantees for individual regret retain a polylogarithmic dependence on the horizon. We remove…

cs.LG2026

Denoising as Projection: Constrained Optimization with Gradient-Guided Diffusion

Runyu Zhang, Jiawei Zhang, Gioele Zardini +2

Diffusion models are increasingly used not only for sampling from learned data distributions, but also for generating samples that optimize task-specific objectives. A common appro…

cs.LG2026

Training with (Swap) Regret Loss in a Single-Layer Self-Attention Model: A Case Study on the Probability Simplex

Chanwoo Park, Asuman Ozdaglar

We revisit the regret loss framework introduced in Park et al. (2025), which uses decision-theoretic regret as a direct loss function for training models to make better decisions,…

cs.GT2026

Equilibrium with Internal Transfers

Mingyang Liu, Gabriele Farina, Asuman Ozdaglar

Nash equilibrium (NE) arises from selfish utility maximization, yet its social welfare can be arbitrarily far from optimal. Moreover, computing an NE is intractable in general. We…

cs.LG2026

Regret Minimization with Adaptive Opponents in Repeated Games

Mingyang Liu, Asuman Ozdaglar, Tiancheng Yu +1

In this paper, we study regret minimization in repeated games with \emph{adaptive} opponents who can respond based on histories of play. The standard metric of \emph{external regre…