Actions Speak Louder Than Words: Rate-Reward Trade-off in Markov Decision Processes
Haotian Wu, Gongpu Chen, Deniz Gündüz
Abstract
The impact of communication on decision-making systems has been extensively studied under the assumption of dedicated communication channels. We instead consider communicating through actions, where the message is embedded into the actions of an agent which interacts with the environment in a Markov decision process (MDP) framework. We conceptualize the MDP environment as a finitestate channel (FSC), where the actions of the agent serve as the channel input, while the states of the MDP observed by another agent (i.e., receiver) serve as the channel output. Here, we treat the environment as a communication channel over which the agent communicates through its actions, while at the same time, trying to maximize its reward. We first characterize the optimal information theoretic trade-off between the average reward and the rate of reliable communication in the infinite-horizon regime. Then, we propose a novel framework to design a joint control/coding policy, termed Act2Comm, which seamlessly embeds messages into actions. From a communication perspective, Act2Comm functions as a learning-based channel coding scheme for non-differentiable FSCs under input-output constraints. From a control standpoint, Act2Comm learns an MDP policy that incorporates communication capabilities, though at the cost of some control performance. Overall, Act2Comm effectively balances the dual objectives of control and communication in this environment. Experimental results validate Act2Comm's capability to enable reliable communication while maintaining a certain level of control performance.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c2ac7ef3-0bd3-4c97-b6c7-71eb9addc895Builds on5
- Learning Efficient Multi-agent Communication: An Information Bottleneck ApproachRundong Wang, Xu He, Runsheng Yu, Wei Qiu et al.ICML 2020 · 133 citations
- KO codes: inventing nonlinear encoding and decoding for reliable wireless communication via deep-learningAshok Vardhan Makkuva, Xiyang Liu, Mohammad Vahid Jamali, Hessam Mahdavifar et al.ICML 2021 · 52 citations
- Learning to Communicate Implicitly by ActionsZheng Tian, Shihao Zou, Ian Davies, Tim Warr et al.AAAI 2020 · 35 citations
- RGMComm: Return Gap Minimization via Discrete Communications in Multi-Agent Reinforcement LearningJingdi Chen, Tian Lan, Carlee Joe-WongAAAI 2024 · 18 citations
- Towards Practical and Scalable Molecular NetworksJiaming Wang, Sevda Ögüt, Haitham Al-Hassanieh, Bhuvana KrishnaswamySIGCOMM 2023 · 6 citations
Related papers
- Communicating via Markov Decision ProcessesSamuel Sokota, Christian A. Schröder de Witt, Maximilian Igl, Luisa M. Zintgraf et al.ICML 2022 · 14 citations
- Learning Multi-Agent Communication with Contrastive LearningYat Long Lo, Biswa Sengupta, Jakob Nicolaus Foerster, Michael NoukhovitchICLR 2024 · 11 citations
- Communication Learning via Backpropagation in Discrete Channels with Unknown NoiseBenjamin Freed, Guillaume Sartoretti, Jiaheng Hu, Howie ChosetAAAI 2020 · 22 citations
- Learning Nearly Decomposable Value Functions Via Communication MinimizationTonghan Wang, Jianhao Wang, Chongyi Zheng, Chongjie ZhangICLR 2020 · 170 citations
- Multi-Agent Reinforcement Learning with Communication-Constrained PriorsGuang Yang, Tianpei Yang, Jingwen Qiao, Yanqing Wu et al.NeurIPS 2025 · 9 citations
