ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “two-player communication model”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CCcs.DSTheoreticalRecentJul 8, 2026

Gap-Majority Lemmas in Communication Complexity

Pachara Sawettamalya, Huacheng Yu

The paper proves an information-theoretically optimal gap-majority lemma in the two-player randomized communication model, achieving the correct linear scaling and constant-constant tradeoff.

View →
cs.MAmath.DSTheoreticalRecentJul 8, 2026

Stability and Convergence of Optimistic Exponential Weights with Asymmetric Step Sizes in Bimatrix Games

Hédi Hadiji, Sarah Sachs

This paper investigates the convergence and stability of equilibria in bimatrix two-player games using the optimistic exponential weights method, allowing step sizes to differ.

View →
cs.CRcs.AIcs.LGRecentMar 17, 2026

Learning Communication Between Heterogeneous Agents in Multi-Agent Reinforcement Learning for Autonomous Cyber Defence

Alex Popa, Adrian Taylor, Ranwa Al Mallah

This paper demonstrates that using a communication algorithm (CommFormer) with heterogeneous agents significantly improves the speed and performance of multi-agent reinforcement learning for autonomou…

View →
cs.MAEmpiricalRecentJul 3, 2026

MUTE: Return-Preserving Communication Unlearning for Efficient Multi-Agent Coordination

Rui Zuo, Qinwei Huang, Mingyang Li, Zhenhang Zhang +2 more

This paper proposes MUTE, a framework for reducing communication in Multi-Agent Reinforcement Learning under bandwidth constraints by unlearning irrelevant messages.

View →
cs.CRcs.AIRecentMar 22, 2026

Is Monitoring Enough? Strategic Agent Selection For Stealthy Attack in Multi-Agent Discussions

Qiuchi Xiang, Haoxuan Qu, Hossein Rahmani, Jun Liu

The paper develops a novel attack method for multi-agent discussions under continuous monitoring, demonstrating that monitoring alone is insufficient to secure these systems.

View →
cs.ITcs.GTcs.NITheoreticalRecentJul 17, 2026

Strategic Persuasion Through Information Timeliness

Ahmet Bugra Gundogan, Melih Bastopcu

A paper on dynamic strategic communication problem where a sender controls the timing of truthful updates from binary Markov sources and aims to persuade the receiver to estimate the state as 1, while…

View →
cs.LGcs.AIEmpiricalRecentJul 17, 2026

When Do Multi-Agent Systems Help? An Information Bottleneck Perspective

Wendi Yu, Lianhao Zhou, Xiangjue Dong, Sai Sudarshan Barath +5 more

This paper provides an information bottleneck perspective on the differences between single-agent and multi-agent systems, showing that the advantage of MAS arises under bounded relays and introducing…

View →
cs.MAcs.GTcs.ROTheoreticalRecentJun 15, 2026

Intermittent Strategic Cooperation of Two Selfish Agents on Graphs

Itay Shedlezki, Noa Agmon

This paper characterizes Pure Nash Equilibria and presents a polynomial-time algorithm for finding them in the Intermittent Strategic Cooperation-Based Two-Agent Path Planning game.

View →
cs.AIRecentJun 1, 2026

MOC: Multi-Order Communication in LLM-based Multi-Agent Systems

Yao Guan, Lin Wang, Zhihu Lu, Ziyi Wang +2 more

The paper proposes Multi-Order Communication (MOC) to overcome the limitations of standard first-order message passing in LLM-based multi-agent systems, significantly improving performance by capturin…

View →
cs.AIcs.GTEmpiricalRecentJul 7, 2026

FootsiesGym: A Fighting Game Benchmark for Two-Player Zero-Sum Imperfect-Information Games

Chase McDonald, Nathan Tsang, Wesley N. Kerr

The paper introduces FootsiesGym, an open-source environment for learning in a two-player, zero-sum, imperfect-information game, providing a vectorized simulator for efficient analysis.

View →
cs.MAcs.AIRecentJun 1, 2026

Dynamic Trust-Aware Sparse Communication Topology for LLM-Based Multi-Agent Consensus

Wanshuang Gou, Zihan Liu

The paper proposes DySCo, a dynamic trust-aware sparse consensus mechanism, to efficiently manage communication in multi-agent LLM systems by selectively connecting agents based on real-time value, th…

View →
cs.CCcs.DMcs.DSTheoreticalRecentJul 3, 2026

Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width

Thobias Kvalvik Høivik, Erlend Raa Vågset

The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…

View →
cs.ITcs.GTeess.SPTheoreticalRecentJul 20, 2026

Compositional Semantic Communication for Physical AI: Category Theory Meets Game Theory

Christo Kurisummoottil Thomas, Walid Saad, Emilio Calvanese Strinati

This paper proposes a framework for compositional semantic communication (CSC) in physical AI systems, enabling heterogeneous devices to transmit semantic representations that compose meaningfully at…

View →
cs.MAEmpiricalRecentJul 24, 2026

Reliability-Contagion Feasibility in LLM Multi-Agent Networks

Ruiwu Niu, Xincheng Shu, Ying Zhao

This paper introduces a correction-aware network model to study the spread of erroneous claims in communication networks and characterizes the intersection of reliability and error control constraints…

View →
cs.CRRecentMay 29, 2026

A Moderatorless Protocol for WEREWOLF

Naoki Kitamura, Hironori Kiya, Hirotaka Ono

The paper presents a complete, moderatorless protocol for playing Werewolf using only ordinary playing cards, eliminating the need for a trusted third party or digital devices.

View →
cs.AIRecentMay 27, 2026

TCP-MCP: Landscape-Guided Co-Evolution of Prompts and Communication Topologies for Multi-Agent Systems

Yi Ding, Zijie Xuan, Haowei Zhou, Zhenyu Ju +5 more

The paper proposes TCP-MCP, a co-evolution framework that jointly optimizes agent prompts and communication topologies to design highly efficient and effective multi-agent systems.

View →
cs.CLRecentMay 28, 2026

Can LLM Teams Play What? Where? When?

Anastasia Kotelnikova, Viktor Byzov, Maria Dolzhenkova, Evgeny Kotelnikov

This paper investigates if team-based interaction improves LLM performance on complex reasoning tasks (ChGK), finding that structured team strategies significantly boost accuracy by acting as error-fi…

View →