arxiv
PublishedJuly 14, 2026 at 4:00 AM
Beyond Bayesian Nash: Learning Minimax-Regret Equilibria for Adversarial Team Games under Asymmetric Information
Publisher summary· verbatim
arXiv:2607.09993v1 Announce Type: cross Abstract: 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. Und
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivAdaptive Mamba Neural Operators1harxivThe Many Senses of Visual Similarity: A Text-Prompted Image Perceptual Metric1harxivHierarchical Reinforcement Learning for Air Combat at DARPA's AlphaDogfight Trials1harxivmHC-GNN: Manifold-Constrained Hyper-Connections for Graph Neural Networks1hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗