Policy Optimization and Statistical Inference for Online Contextual Matrix Games

The paper introduces online contextual matrix games, a framework that merges contextual bandits with multi‑player online games to handle dynamic contexts and strategic interactions. It presents OnGameLearn, an algorithm that balances exploration and exploitation across actions and contexts, providing statistical guarantees such as tail bounds, Nash equilibrium convergence, asymptotic normality, and sublinear regret. The authors also define a policy value for matrix games and propose a doubly robust, √T‑consistent estimator, demonstrating effectiveness through simulations and a hotel pricing case study.

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.

• agents