Metraipolis › archive › dc_7fe67be48d3c
CoupVisor: Strategy Optimization by Round and Challenge Decision Support — arXiv:2608.15868
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.15868
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T17:29:05.473Z
- SHA-256 of the archived text
230a22765d6aa8301063e716228f2f87d1d1ab03abe25472607341a985019794- Stable URL of this page
https://metraipolis.com/documento/dc_7fe67be48d3c
How to cite
CoupVisor: Strategy Optimization by Round and Challenge Decision Support — arXiv:2608.15868 — arXiv (en), https://arxiv.org/abs/2608.15868 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7fe67be48d3c (Metraipolis archive dc_7fe67be48d3c, sha256 230a22765d6aa8301063e716228f2f87d1d1ab03abe25472607341a985019794)
BibTeX
@misc{dc7fe67be48d3c,
title = {CoupVisor: Strategy Optimization by Round and Challenge Decision Support — arXiv:2608.15868},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.15868},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7fe67be48d3c; sha256 230a22765d6aa8301063e716228f2f87d1d1ab03abe25472607341a985019794},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15868. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-18 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI) ; Computer Science and Game Theory (cs.GT); Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2608.15868 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T16:29:13.836Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).