Compartmental observability approach for the optimal transparency problem in multi-agent systems
From MaRDI portal
Publication:2158971
DOI10.1016/J.AUTOMATICA.2022.110398zbMATH Open1497.93027arXiv2101.07178OpenAlexW4285040473MaRDI QIDQ2158971FDOQ2158971
Authors: Sadegh Arefizadeh, Sadjaad Ozgoli, Sadegh Bolouki, Tamer Başar 
Publication date: 26 July 2022
Published in: Automatica (Search for Journal in Brave)
Abstract: This paper considers a network of agents, where each agent is assumed to take actions optimally with respect to a predefined payoff function involving the latest actions of the agent's neighbors. Neighborhood relationships stem from payoff functions rather than actual communication channels between the agents. A principal is tasked to optimize the network's performance by controlling the information available to each agent with regard to other agents' latest actions. The information control by the principal is done via a partial observability approach, which comprises a static partitioning of agents into blocks and making the mean of agents' latest actions within each block publicly available. While the problem setup is general in terms of the payoff functions and the network's performance metric, this paper has a narrower focus to illuminate the problem and how it can be addressed in practice. In particular, the performance metric is assumed to be a function of the steady-state behavior of the agents. After conducting a comprehensive steady-state analysis of the network, an efficient algorithm finding optimal partitions with respect to various performance metrics is presented and validated via numerical examples.
Full work available at URL: https://arxiv.org/abs/2101.07178
Recommendations
- Distributed constraint optimization on networked multi-agent systems
- Performance optimization of multi-agent systems
- Computational social choice for coordination in agent networks
- Game-Theoretic Learning and Distributed Optimization in Memoryless Multi-Agent Systems
- Distributed optimal control for multi-agent trajectory optimization
Cites Work
- Title not available (Why is that?)
- Algorithmic Game Theory
- Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
- Efficient Use of Information and Social�Value�of�Information
- Title not available (Why is that?)
- Information Acquisition and Welfare
- Improved bounds on Bell numbers and on moments of sums of random variables
- Handbook of game theory with economic applications. Vol. 1
- Dynamic Games With Asymmetric Information and Resource Constrained Players With Applications to Security of Cyberphysical Systems
- The Role of Information in Distributed Resource Allocation
- An Efficient Market Design for Electricity Networks With Strategic Users Possessing Local Information
- Distributed convergence to Nash equilibria in network and average aggregative games
- Hierarchical multistage Gaussian signaling games in noncooperative communication and control systems
- Dynamics on linear influence network games under stochastic environments
- Distributed Submodular Maximization With Limited Information
- Bayesian Graphical Games for Synchronization in Networks of Dynamical Systems
Cited In (1)
This page was built for publication: Compartmental observability approach for the optimal transparency problem in multi-agent systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158971)
