Search Results for author:
Found 6 papers, 2 papers with code
Converging to Team-Maxmin Equilibria in Zero-Sum Multiplayer Games
Second, we design an ISG variant for TMEs (ISGT) by exploiting that a TME is an NE maximizing the team’s utility and show that ISGT converges to a TME and the impossibility of relaxing conditions in ISGT.
Grasper: A Generalist Pursuer for Pursuit-Evasion Problems
Pursuit-evasion games (PEGs) model interactions between a team of pursuers and an evader in graph-based environments such as urban street networks.
Offline Equilibrium Finding
Extensive experimental results demonstrate the superiority of our approach over offline RL algorithms and the importance of using model-based methods for OEF problems.
Solving Large-Scale Extensive-Form Network Security Games via Neural Fictitious Self-Play
Securing networked infrastructures is important in the real world.
CFR-MIX: Solving Imperfect Information Extensive-Form Games with Combinatorial Action Space
The challenge of solving this type of game is that the team's joint action space grows exponentially with the number of agents, which results in the inefficiency of the existing algorithms, e. g., Counterfactual Regret Minimization (CFR).
Learning Expensive Coordination: An Event-Based Deep RL Approach
The main difficulties of expensive coordination are that i) the leader has to consider the long-term effect and predict the followers' behaviors when assigning bonuses and ii) the complex interactions between followers make the training process hard to converge, especially when the leader's policy changes with time.
