Skip to content
Preprint

CoupVisor: Strategy Optimization by Round and Challenge Decision Support

Aug 2026 · 0 citations · 12 references
Computer Science

TL;DR

The main finding is that the choice of reward, whether it rewards short-term gains or ultimately winning the game, decides which learning approach performs best, and that a win-oriented reward produces a policy that outperforms all baselines.

Abstract

This paper presents CoupVisor, a decision-support system for the hidden-information card game Coup. It addresses two questions: what a player should do on each turn, and when a player should challenge an opponent's claim. The system is built around a single description of game events, which is shared across manual play, replay of recorded games, simulation, belief tracking, advisor recommendations, and learning-based policies. CoupVisor estimates the chance that a claim is truthful by combining how likely each role is with how many cards the claimant still holds, which corrects a case where the very first claim of a game was flagged as suspicious despite no evidence. We compare a rule-following advisor and several learned and heuristic players across many simulated games and different opponent styles. Our main finding is that the choice of reward, whether it rewards short-term gains or ultimately winning the game, decides which learning approach performs best, and that a win-oriented reward produces a policy that outperforms all baselines.

View source

Similar papers

#natural language process... Preprint Oct 2026

Finding the Move Is Not Winning the Game: XiangqiBench for Closed-Loop Evaluation of LLM Agents

Static evaluations credit a language model for naming the right move, but an agent must carry a plan through to a verified outcome while an opponent responds. We introduce XiangqiBench, an executable benchmark that measures this difference in Chinese chess: starting from 119 tactical endgames with forced mates supporte...

Yekun Chai, Qiwei Peng, Hao-Yi Xiong · 0 citations
#artificial intelligence Preprint Sep 2026

Learnable Randomization as Commitment Against Adaptive Optimizers

This work studies unpredictable near-optimal policies (UNOP), which mix uniformly on near-best actions that remain individually rational and which can be learned and the optimizer can match its best response, while the user's payoff stays higher because the mixture changes which action is targeted.

Zi-Han Deng, Chuanzhi Xu, Xiao-Zhen Zhong et al. · 0 citations
Preprint Aug 2026

Winning Before You Play: An Iterative Capture Algorithm for Pre-Game Dominance Analysis in Three-Player Auction Bridge

This paper introduces an innovative and bias-free variant of a three-player auction bridge, specifically designed to address structural limitations found in traditional formats. In a standard auction bridge, the partner of the winning bidder often plays a passive role, possessing minimal influence over the outcome once...

S. Sarkar · 0 citations
#artificial intelligence Preprint Oct 2026

A Trust Layer for Agent Evaluation

A Trust Layer for Agent Evaluation is introduced, an additive post-hoc framework that reports, beside each recorded score, whether it should be believed, whether the result is stable under repeated execution.

Mohammadreza Sediqin, Shivali Dalmia, Srinivasa Karthikeya Reddy Kovvuri et al. · 2 citations
Open access Sep 2026

CFR variant and iterate reporting in small imperfect-information games

Empirical comparisons of counterfactual regret minimization (CFR) variants often mix two distinct choices: the update rule used during training and the iterate reported at evaluation time. This note isolates those choices in an exact small-game setting where exploitability is computed by exact best response, so no me...

Behbod Keshavarzi, H. Navidi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.