No article text was recorded for this version.
exploitation-robustness tradeoff
Version 1 of 163 papers90 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Population-based Evaluation in Repeated Rock-Paper-Scissors as a Benchmark for Multiagent Reinforcement Learning
- Blog: Finding Optimal Abstract Strategies in Extensive-Form Games
- Blog: Computing Approximate Nash Equilibria and Robust Best-Responses Using Sampling
- Blog: A Survey of Opponent Modeling in Adversarial Domains
- Blog: A New Algorithm for Generating Equilibria in Massive Zero-Sum Games
- Blog: PokerBench: Training Large Language Models to Become Professional Poker Players
- Blog: Safe Exploitative Play with Untrusted Type Beliefs
- Blog: Computing Robust Counter-Strategies
- Blog: Safe and Robust Subgame Exploitation in Imperfect Information Games
- Blog: Deep Synoptic Monte-Carlo Planning in Reconnaissance Blind Chess
- Blog: Regret Minimization in Behaviorally-Constrained Zero-Sum Games
- Blog: Subgame solving without common knowledge
- Blog: Safe Opponent-Exploitation Subgame Refinement
- Blog: Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games
- Blog: The Cost of Blind Confidence: Opponent Modeling under Imperfect Information
- Blog: Computing Approximate Nash Equilibria and Robust Best-Responses Using Sampling
- Blog: Safe and Nested Subgame Solving for Imperfect-Information Games
- Blog: Using Response Functions to Measure Strategy Strength
- Blog: A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation
- Blog: Effective Short-Term Opponent Exploitation in Simplified Poker
- Blog: FightLadder: A Benchmark for Competitive Multi-Agent Reinforcement Learning
- Blog: Evolving Neural Networks to Focus Minimax Search
- Blog: Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead
- Blog: Optimising Game Tactics for Football
- Blog: Continual Depth-limited Responses for Computing Counter-strategies in Extensive-form Games
- Blog: Survey of Artificial Intelligence for Card Games and Its Application to the Swiss Game Jass
- Blog: Safe Opponent Exploitation For Epsilon Equilibrium Strategies
- Blog: Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Games
- Blog: Preference-CFR: Beyond Nash Equilibrium for Better Game Strategies
- Blog: New Criteria and a New Algorithm for Learning in Multi-Agent Systems
- Blog: Solving Heads-Up Limit Texas Hold'em
- Blog: Simplex Neural Population Learning: Any-Mixture Bayes-Optimality in Symmetric Zero-sum Games
- Blog: Posterior sampling for multi-agent reinforcement learning: solving extensive games with imperfect information
- Blog: Simplex Neural Population Learning: Any-Mixture Bayes-Optimality in Symmetric Zero-sum Games
- Blog: Computer Game Playing
- Blog: No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation
- Blog: Greedy when Sure and Conservative when Uncertain about the Opponents
- Blog: Simplex Neural Population Learning: Any-Mixture Bayes-Optimality in Symmetric Zero-sum Games
- Blog: Super-Human AI for Strategic Reasoning: Beating Top Pros in Heads-Up No-Limit Texas Hold'em
- Blog: Data Biased Robust Counter Strategies
- Blog: JiangJun: Mastering Xiangqi by Tackling Non-Transitivity in Two-Player Zero-Sum Games
- Blog: Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium
- Blog: Learning Markov Games with Adversarial Opponents: Efficient Algorithms and Fundamental Limits
- Blog: Wiretapping a hidden network
- Blog: Extracting Learned Discard and Knocking Strategies from a Gin Rummy Bot
- Blog: Strategy Grafting in Extensive Games
- Blog: Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations
- Blog: PATROL: Provable Defense against Adversarial Policy in Two-player Games
- Blog: FightLadder: A Benchmark for Competitive Multi-Agent Reinforcement Learning
- Blog: Continual Depth-limited Responses for Computing Counter-strategies in Extensive-form Games
- Blog: Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games
- Blog: A Heuristic Evaluation Function for Hand Strength Estimation in Gin Rummy
- Blog: Using Reasoning Patterns to Help Humans Solve Complex Games
- Blog: Greedy when Sure and Conservative when Uncertain about the Opponents
- Blog: Dueling Algorithms
- Blog: Real-Time Opponent Modeling in Trick-Taking Card Games
- Blog: Using Modified UCT Algorithm Basing on Risk Estimation Methods in Imperfect Information Games
- Blog: Online Double Oracle
- Blog: Learning Markov Games with Adversarial Opponents: Efficient Algorithms and Fundamental Limits
- Blog: Population-based Evaluation in Repeated Rock-Paper-Scissors as a Benchmark for Multiagent Reinforcement Learning
Showing 60 of 63 papers.
History & citation
Current · Permanent link
- Exploiting Suboptimal Opponents in Competitive Games merged into this direction (62% overlap)
- Safe Exploitative Play in Competitive Games merged into this direction (88% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_exploitation_robustness_tradeoff_0530b311,
title = {exploitation-robustness tradeoff},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/exploitation-robustness-tradeoff/rdr_0530b31135c6448788fc41d6b741c19a},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_exploitation_robustness_tradeoff_0530b311_v1,
title = {exploitation-robustness tradeoff},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/exploitation-robustness-tradeoff/rdr_0530b31135c6448788fc41d6b741c19a/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}