paper-with-me

Papers

LLMs as Agentic Cooperative Players in Multiplayer UNO

2025-09-11 · Yago Romano Matinez, Jesse Roberts arxiv

LLMs promise to assist humans -- not just by answering questions, but by offering useful guidance across a wide range of tasks. But how far does that assistance go? Can a large language model based agent actually help someone accomplish their goal as an active participant? We test this question by engaging an LLM in UNO, a turn-based card game, asking it not to win but instead help another player to do so. We built a tool that allows decoder-only LLMs to participate as agents within the RLCard game environment. These models receive full game-state information and respond using simple text prompts under two distinct prompting strategies. We evaluate models ranging from small (1B parameters) to large (70B parameters) and explore how model scale impacts performance. We find that while all models were able to successfully outperform a random baseline when playing UNO, few were able to significantly aid another player.

📄 PDF Abstract BibTeX arXiv:2509.09867

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

CollabBench: Benchmarking and Unleashing Collaborative Ability of LLMs with Diverse Players via Proactive Engagement

2026-06-04 · Hong Qian, Yuanhao Liu, Zihan Zhou, Zongbao Zhang 외 arxiv

While LLM-based agents excel at individual tasks, effective collaboration with realistic human partners remains challenging. Most of the existing conversation-level collaborative studies lack grounded interaction and beh…

Optimal Cooperative Multiplayer Learning Bandits with Noisy Rewards and No Communication

2023-11-10 · William Chang, Yuanhao Lu

We consider a cooperative multiplayer bandit learning problem where the players are only allowed to agree on a strategy beforehand, but cannot communicate during the learning process. In this problem, each player simulta…

The Effect of Communication on Noncooperative Multiplayer Multi-Armed Bandit Problems

2017-11-05 · Noyan Evirgen, Alper Kose

We consider decentralized stochastic multi-armed bandit problem with multiple players in the case of different communication probabilities between players. Each player makes a decision of pulling an arm without cooperati…

Thompson Sampling

A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players

2019-02-04 · Etienne Boursier, Emilie Kaufmann, Abbas Mehrabian, Vianney Perchet

We study a multiplayer stochastic multi-armed bandit problem in which players cannot communicate, and if two or more players pull the same arm, a collision occurs and the involved players receive zero reward. We consider…

Open-Ended Question Answering

Bayesian Learning of Play Styles in Multiplayer Video Games

2021-12-14 · Aline Normoyle, Shane T. Jensen

The complexity of game play in online multiplayer games has generated strong interest in modeling the different play styles or strategies used by players for success. We develop a hierarchical Bayesian regression approac…

Clusteringregression