arXiv Machine Learning July 10, 2026 By Nika Haghtalab, Chara Podimata, Kunhe Yang

Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents

Read the original on arXiv Machine Learning →

arXiv:2306. 02704v2 Announce Type: replace-cross Abstract: We introduce \emph{Calibrated Stackelberg Games (CSGs)}, a generalization of the standard Stackelberg Games (SGs) framework.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 5

Regret Minimization with Adaptive Opponents in Repeated Games

arXiv:2606. 06486v1 Announce Type: new Abstract: In this paper, we study regret minimization in repeated games with \emph{adaptive} opponents who can respond based on histories of play.

By Mingyang Liu, Asuman Ozdaglar, Tiancheng Yu, Kaiqing Zhang

arXiv Machine Learning

Jul 16

Adaptive Conformal Inference through the Lens of Blackwell Approachability

arXiv:2510. 15824v2 Announce Type: replace-cross Abstract: This article considers an online version of conformal inference, called adaptive conformal inference [ACI] and introduced by Gibbs and Cand\`es (2021): prediction sets are issued sequentially, after observing features and before the outcomes are revealed.

By Guillaume Principato, Gilles Stoltz

safety

arXiv AI

Jul 10

Provably Optimal Learning Algorithms for Assistance Games

arXiv:2607. 08012v1 Announce Type: cross Abstract: This paper studies an online variant of the assistance games framework, where an informed agent and an uninformed agent repeatedly interact over $T$ timesteps to optimize a common reward function.

By Nivasini Ananthakrishnan, Mark Bedaywi, Michael I. Jordan, Stuart Russell, Nika Haghtalab

agents

arXiv AI

Jun 29

Conservative Equilibrium Discovery in Offline Game-Theoretic Multiagent Reinforcement Learning

arXiv:2603. 00374v2 Announce Type: replace Abstract: Offline learning of strategies takes data efficiency to its extreme by restricting algorithms to a fixed dataset of state-action trajectories.

By Austin A. Nguyen, Michael P. Wellman

reinforcement-learning benchmarks

arXiv Machine Learning

Jun 30

Theoretical Foundations and Effective Algorithms for Policy-Aware Simulator Learning

arXiv:2605. 29032v2 Announce Type: replace Abstract: Model-based reinforcement learning (MBRL) agents typically learn world models by minimizing predictive loss.

By Christoph Dann, Yishay Mansour, Mehryar Mohri

agents reinforcement-learning safety

arXiv Machine Learning

2d ago

Towards More Efficient, Robust, Instance-adaptive, and Generalizable Sequential Decision making

arXiv:2504.09192v5 Announce Type: replace Abstract: The primary goal of my Ph.D. study is to develop provably efficient and practical algorithms for data-driven sequential decision-making under uncer...

By Zhiyong Wang

llms reinforcement-learning robotics fine-tuning safety

One email a morning, machine-written

Related stories

Regret Minimization with Adaptive Opponents in Repeated Games

Adaptive Conformal Inference through the Lens of Blackwell Approachability

Provably Optimal Learning Algorithms for Assistance Games

Conservative Equilibrium Discovery in Offline Game-Theoretic Multiagent Reinforcement Learning

Theoretical Foundations and Effective Algorithms for Policy-Aware Simulator Learning

Towards More Efficient, Robust, Instance-adaptive, and Generalizable Sequential Decision making