CORTEXA
← Browse
arxivcs.AIcs.GT2026-06-30

A Contextual-Bandit Oversight Game with Two-Sided Informational Asymmetry

Yunjin Tong

We study runtime human oversight of an AI agent when private information runs in both directions: the human privately knows her reward function, while the AI privately knows the quality of the action it proposes. This is the kind of asymmetry that arises naturally when an autonomous robot or software agent has inspected a situation its human supervisor cannot directly assess. Building on Cooperative Inverse Reinforcement Learning (CIRL) and the Oversight Game, we introduce a contextual-bandit team game with two-sided asymmetric information and a play/ask/trust/oversee interface. The bandit structure removes physical state transitions and thereby yields exact one-shot characterizations that would remain conjectural in the full POMDP setting, though the common belief remains a dynamically controlled state across rounds. We give two one-shot characterizations, a team optimum and a behaviorally natural myopic rule, whose gap is a slab of avoidable harm: a region in which the AI privately knows the proposed action is harmful and shutdown would help, yet a myopic human, trusting her prior, declines to oversee. We show this gap is the price of non-credible oversight communication, and give a partial analysis of how it resolves dynamically over repeated rounds through passive learning and active signaling with a one-period-lagged oversight response.

View free PDFSource page

Related papers

arxivcs.AIcs.GT2026-07-07

FootsiesGym: A Fighting Game Benchmark for Two-Player Zero-Sum Imperfect-Information Games

Chase McDonald, Nathan Tsang, Wesley N. Kerr

We present FootsiesGym, an open-source environment for learning in a non-trivial two-player, zero-sum, imperfect-information game. Built on HiFight's minimalist 2D fighting game Footsies, it isolates the cyclic, non-transitive strategic interactions of fighting game neutral play…

View free PDFSource page
arxivcs.GTcs.AIcs.MA2026-06-28

Projected Exploitability Descent for Nash Equilibrium Computation in Multiplayer Imperfect-Information Games

Sam Ganzfried

Many important games have more than two players and imperfect information. Existing approaches for computing Nash equilibrium, the central game-theoretic solution concept, in such games either lack scalability or obtain poor performance. In this paper we introduce a new algorithm…

View free PDFSource page
arxivcs.GTcs.AIcs.LGcs.MA2026-07-10

Beyond Bayesian Nash: Learning Minimax-Regret Equilibria for Adversarial Team Games under Asymmetric Information

Naman Aggarwal, Jonathan P. How

Adversarial team games (ATGs) with asymmetric information, such as adversarial path-finding, goal search, and reachability games on graphs, require strategies that are robust to hidden opponent types, such as a hidden goal flag, and to deception. Under asymmetric information, dec…

View free PDFSource page
arxivcs.LGcs.AIcs.GT2026-07-07

A Gold-Standard Study of What Makes a Lightweight Game-Playing Agent Strong

Nima Kelidari, Mohammadsaeed Haghi, Mahdi Salmani

Reinforcement learning agents for imperfect-information card games are only as strong as the opponents they train against, and they are hard to grade, since they beat a random opponent over 99 percent of the time and only tie copies of themselves. So we build a strong, fixed, rul…

View free PDFSource page