LLMs for Game Theory: Entropy-Guided In-Context Learning and Adaptive CoT Reasoning

arXiv:2601.10775v2 Announce Type: replace Abstract: We propose a novel LLM-based framework for reasoning in discrete, game-theoretic tasks, illustrated with Tic-Tac-Toe. The method integrates in-context learning with entropy-guided chain-of-thought (CoT) reasoning and adaptive context retrieval. The model dynamically adjusts both the number of retrieved examples and reasoning paths according to token-level uncertainty: concise reasoning with minimal context is used when uncertainty is low, whereas higher uncertainty triggers expanded multi-path CoT exploration. Experimental evaluation against a sub-optimal algorithmic opponent shows that entropy-aware adaptive reasoning substantially improves decision quality, increasing the average game outcome from (-11.6%) with the baseline LLM to (+9.5%) with entropy-guided adaptive reasoning over 100 games (win = +1, tie = 0, loss = -1), while maintaining a relatively low number of LLM queries per game. Statistical validation confirms that the improvement is significant, and correlation analysis reveals a negative association between token-level entropy and move optimality. These findings demonstrate that uncertainty-guided adaptive reasoning effectively enhances LLM performance in sequential decision-making environments.

Related

• Task Vectors, Learned Not Extracted: Performance Gains and Mechanistic Insight
• Adaptive Multi-Expert Reasoning via Difficulty-Aware Routing and Uncertainty-Guided Aggregation
• CoG: Controllable Graph Reasoning via Relational Blueprints and Failure-Aware Refinement over Knowledge Graphs
• Localizing Task Recognition and Task Learning in In-Context Learning via Attention Head Analysis
• PILOT: Planning via Internalized Latent Optimization Trajectories for Large Language Models

Source: arXiv cs.CL | 2026-04-14