paper-with-me

Papers

Strategy-Augmented Planning for Large Language Models via Opponent Exploitation

2025-05-13 · Shuai Xu, Sijia Cui, Yanna Wang, Bo Xu, Qi Wang

Efficiently modeling and exploiting opponents is a long-standing challenge in adversarial domains. Large Language Models (LLMs) trained on extensive textual data have recently demonstrated outstanding performance in general tasks, introducing new research directions for opponent modeling. Some studies primarily focus on directly using LLMs to generate decisions based on the elaborate prompt context that incorporates opponent descriptions, while these approaches are limited to scenarios where LLMs possess adequate domain expertise. To address that, we introduce a two-stage Strategy-Augmented Planning (SAP) framework that significantly enhances the opponent exploitation capabilities of LLM-based agents by utilizing a critical component, the Strategy Evaluation Network (SEN). Specifically, in the offline stage, we construct an explicit strategy space and subsequently collect strategy-outcome pair data for training the SEN network. During the online phase, SAP dynamically recognizes the opponent's strategies and greedily exploits them by searching best response strategy on the well-trained SEN, finally translating strategy to a course of actions by carefully designed prompts. Experimental results show that SAP exhibits robust generalization capabilities, allowing it to perform effectively not only against previously encountered opponent strategies but also against novel, unseen strategies. In the MicroRTS environment, SAP achieves a 85.35\% performance improvement over baseline methods and matches the competitiveness of reinforcement learning approaches against state-of-the-art (SOTA) rule-based AI.

📄 PDF Abstract BibTeX arXiv:2505.08459

Code (1)

hsushuai/SAP 공식 구현

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

Synthesis of Opacity-Enforcing Winning Strategies Against Colluded Opponent

2023-04-03 · Chongyang Shi, Abhishek N. Kulkarni, Hazhar Rahmani, Jie Fu

This paper studies a language-based opacity enforcement in a two-player, zero-sum game on a graph. In this game, player 1 (P1) wins if it can achieve a secret temporal goal described by the language of a finite automaton…

Motion Planning

Quantitative Planning with Action Deception in Concurrent Stochastic Games

2023-01-03 · Chongyang Shi, Shuo Han, Jie Fu

We study a class of two-player competitive concurrent stochastic games on graphs with reachability objectives. Specifically, player 1 aims to reach a subset $F_1$ of game states, and player 2 aims to reach a subset $F_2$…

Motion Planning

Anticipatory Counterplanning

2022-03-30 · Alberto Pozanco, Yolanda E-Martín, Susana Fernández, Daniel Borrajo

In competitive environments, commonly agents try to prevent opponents from achieving their goals. Most previous preventing approaches assume the opponent's goal is known a priori. Others only start executing actions once…

ToMAP: Training Opponent-Aware LLM Persuaders with Theory of Mind

2025-05-29 · Peixuan Han, Zijia Liu, Jiaxuan You

Large language models (LLMs) have shown promising potential in persuasion, but existing works on training LLM persuaders are still preliminary. Notably, while humans are skilled in modeling their opponent's thoughts and …

A Data-Driven Method for Recognizing Automated Negotiation Strategies

2021-07-03 · Ming Li, Pradeep K. Murukannaiah, Catholijn M. Jonker

Understanding an opponent agent helps in negotiating with it. Existing works on understanding opponents focus on preference modeling (or estimating the opponent's utility function). An important but largely unexplored di…

Feature EngineeringTime SeriesTime Series Analysis