Co-occurring keywords · papers mentioning both
Papers
Spatial Branch-and-Bound for Computing Multiplayer Nash Equilibrium
AAAI 2026
Exploiting Structure in Offline Multi-Agent RL: The Benefits of Low Interaction Rank
ICLR 2025
Nearly Tight Bounds on Approximate Equilibria in Spatial Competition on the Line
AAAI 2025
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games
AISTATS 2023
Learning Mean-Field Games with Discounted and Average Costs
JMLR 2023
Multi-Leader Congestion Games with an Adversary
AAAI 2022
Robust Solutions for Multi-Defender Stackelberg Security Games
IJCAI 2022
XDO: A Double Oracle Algorithm for Extensive-Form Games
NeurIPS 2021
On the Convergence of Model Free Learning in Mean Field Games
AAAI 2020
An Improved Quasi-Polynomial Algorithm for Approximate Well-Supported Nash Equilibria
AAAI 2019
Empirical Mechanism Design: Designing Mechanisms from Data
UAI 2019
Non-decreasing Payment Rules for Combinatorial Auctions
IJCAI 2018
(weak) Calibration is Computationally Hard
COLT 2012