Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2102.13047 · IEEE Transactions on Automatic Control

Maximizing Social Welfare and Agreement via Information Design in Linear-Quadratic-Gaussian Games

Furkan Sezer, Hossein Khazaei, Ceyhun Eksin

Published Apr 25, 2023• 6 citations
arXivHTMLPDF

Abstract

Information design in an incomplete information game involves a designer that aims to influence players' actions through signals generated from a designed probability distribution to optimize its objective function. For quadratic design objective functions, if the players have quadratic payoffs that depend on the players' actions and an unknown payoff-relevant state, and signals on the state that follow a Gaussian distribution conditional on the state realization, the information design problem is a semidefinite program (SDP) (Ui, 2020). In this note, we seek to characterize the optimal information design analytically by leveraging the SDP formulation, when the design objective is to maximize social welfare or the agreement among players' action. We show that full information disclosure maximizes social welfare when there is a common payoff state, the payoff dependencies among players' actions are homogeneous, or when the signals are public. When the objective is to maximize the agreement among players' actions, not revealing any information is optimal. When the objective is a weighted combination of social welfare and agreement terms, we establish a threshold weight below which full information disclosure is optimal under public signals for games with homogeneous payoffs. Numerical results corroborate the analytical results, and identify partial information disclosure structures that are optimal.

DOI
10.1109/tac.2023.3270241

Related papers

Information Preferences of Individual Agents in Linear-Quadratic-Gaussian Network Games

Furkan Sezer, Ceyhun Eksin

We consider linear-quadratic-Gaussian (LQG) network games in which agents have quadratic payoffs that depend on their individual and neighbors’ actions, and an unknown payoff-relevant state. An information designer determines the fidelity of information revealed to the agents about the payoff state to maximize the social welfare. Prior results show that full information disclosure is optimal under certain assumptions on the payoffs, i.e., it is beneficial for the average individual. In this paper, we provide conditions for general network structures based on the strength of the dependence of payoffs on neighbors’ actions, i.e., competition, under which a rational agent is expected to benefit, i.e., receive higher payoffs, from full information disclosure. We find that all agents benefit from information disclosure for the star network structure when the game is homogeneous. We also identify that the central agent benefits more than a peripheral agent from full information disclosure unless the competition is strong and the number of peripheral agents is small enough. Despite the fact that all agents expect to benefit from information disclosure ex-ante, a central agent can be worse-off from information disclosure in many realizations of the payoff state under strong competition, indicating that a risk-averse central agent can prefer uninformative signals ex-ante.

arXiv:2203.13056•IEEE Control Systems Letters•Jan 1, 2022•1 citation

Strategic Information Design in Quadratic Multidimensional Persuasion Games with Two Senders

Raj Kiriti Velicheti, Melih Baştopçu, Tamer Başar

In the classical communication setting, multiple senders having access to the same source of information and transmitting it over channel(s) to a receiver, in general, leads to a decrease in estimation error at the receiver. However, if the objectives of the information providers are different from that of the estimator, this might result in interesting strategic interactions. In this work, we consider a hierarchical signaling game between two senders (information designers) and a single receiver (decision maker) each having their own, possibly misaligned, objectives. The senders lead the game by committing to individual information disclosure policies simultaneously, within the framework of a Nash game among themselves. This is followed by the receiver's action decision. With Gaussian information structure and quadratic objectives (which depend on underlying state and receiver's action) for all the players, we show that in general the equilibrium is not unique. While we show that full revelation of the state is always an equilibrium, we propose an algorithm to achieve non trivial equilibria. Through simulations we show that misalignment between senders' objectives is beneficial for the receiver.

Proceedings of the ... American Control Conference/Proceedings of the American Control Conference•May 31, 2023•6 citations

Two-Qubit Pure Entanglement as Optimal Social Welfare Resource in Bayesian Game

Manik Banik, Some Sankar Bhattacharya, Nirman Ganguly +4 more

Entanglement is of paramount importance in quantum information theory. Its supremacy over classical correlations has been demonstrated in a numerous information theoretic protocols. Here we study possible adequacy of quantum entanglement in Bayesian game theory, particularly in social welfare solution (SWS), a strategy which the players follow to maximize sum of their payoffs. Given a multi-partite quantum state as an advice, players can come up with several correlated strategies by performing local measurements on their parts of the quantum state. A quantum strategy is called quantum-SWS if it is advantageous over a classical equilibrium (CE) strategy in the sense that none of the players has to sacrifice their CE-payoff rather some have incentive and at the same time it maximizes sum of all players' payoffs over all possible quantum advantageous strategies. Quantum state yielding such a quantum-SWS is called a quantum social welfare advice (SWA). We show that any two-qubit pure entangled state, even if it is arbitrarily close to a product state, can serve as quantum-SWA in some Bayesian game. Our result, thus, gives cognizance to the fact that every two-qubit pure entanglement is the best resource for some operational task.

arXiv:1703.02773•Quantum•Sep 9, 2019•26 citations

Quadratic Privacy-Signaling Games and the MMSE Information Bottleneck Problem for Gaussian Sources

Ertan Kazıklı, Sinan Gezici, Serdar Yüksel

We investigate a privacy-signaling game problem in which a sender with privacy concerns observes a pair of correlated random vectors which are modeled as jointly Gaussian. The sender aims to hide one of these random vectors and convey the other one whereas the objective of the receiver is to accurately estimate both of the random vectors. We analyze these conflicting objectives in a game theoretic framework with quadratic costs where depending on the commitment conditions (of the sender), we consider Nash or Stackelberg (Bayesian persuasion) equilibria. We show that a payoff dominant Nash equilibrium among all admissible policies is attained by a set of explicitly characterized linear policies. We also show that a payoff dominant Nash equilibrium coincides with a Stackelberg equilibrium. We formulate the information bottleneck problem within our Stackelberg framework under the mean squared error distortion criterion where the information bottleneck setup has a further restriction that only one of the random variables is observed at the sender. We show that this MMSE Gaussian Information Bottleneck Problem admits a linear solution which is explicitly characterized in the paper. We provide explicit conditions on when the optimal solutions, or equilibrium solutions in the Nash setup, are informative or noninformative.

arXiv:2005.05743•IEEE Transactions on Information Theory•May 23, 2022•7 citations

Quadratic Privacy-Signaling Games and Payoff Dominant Equilibria

Ertan Kazıklı, Sinan Gezici, Serdar Yüksel

We consider a privacy-signaling game problem in which a transmitter with privacy concerns and a receiver, which does not pay attention to these privacy concerns, communicate. In this communication scenario, the transmitter observes a pair of correlated random variables which are modeled as jointly Gaussian. The transmitter constructs its message based on these random variables with the aim to hide one of them and convey the other one. In contrast, the objective of the receiver is to accurately estimate both of the random variables so as to gather as much information as possible. These conflicting objectives are analyzed in a game theoretic framework where depending on the commitment conditions (of the sender), we consider Nash or Stackelberg equilibria. We show that a payoff dominant (i.e., most desirable for both players) Nash equilibrium is attained by affine policies and we explicitly characterize these policies. In addition, the strategies at the characterized Nash equilibrium is shown to form also a Stackelberg equilibrium. Furthermore, we show that there always exists an informative Stackelberg equilibrium for the multidimensional parameter setup. We also revisit the information bottleneck problem within our Stackelberg framework under the mean squared error distortion criterion where the information bottleneck setup has a further restriction that only one of the parameters is observed at the sender. We fully characterize the Stackelberg equilibria under certain conditions and when these conditions are not met we establish the existence of informative equilibria.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•3 citations

Information Compression in Dynamic Information Disclosure Games

Dengwang Tang, Vijay Subramanian

We consider a two-player dynamic information design problem for a game played between a principal and a receiver on top of a Markovian system controlled by the receiver’s actions. The principal strategically obtains and shares some information about the underlying system with the receiver in order to influence their actions, and agents’ instantaneous rewards depend only on the system state and receiver actions. In our game, both players have long-term objectives, and the principal sequentially commits to their strategies instead of at the beginning-at every turn the principal can choose randomized experiments to observe the system partially. The principal can share details about the experiments to the receiver. In our analysis the truthful disclosure rule is assumed-the principal is required to truthfully announce each experiment detail and result to the receiver immediately after the result is revealed. Based on the received information, when its their turn the receiver takes an action which influences the state of the underlying system. Using a constructive backward inductive procedure, we show that there exists a Perfect Bayesian Equilibrium in this game where both agents play Canonical Belief Based (CBB) strategies using a compressed version of their information, rather than their full information, to choose experiments (for the principal) or actions (for the receiver).

arXiv:2403.12204•IEEE Conference on Decision and Control (CDC)•Dec 16, 2024•0 citations
Information design in an incomplete information game involves a designer that aims to influence players' actions through signals generated from a designed probability distribution to optimize its objective function. For quadratic design objective functions, if the players have quadratic payoffs that depend on the players' actions and an unknown payoff-relevant state, and signals on the state that follow a Gaussian distribution conditional on the state realization, the information design problem is a semidefinite program (SDP) (Ui, 2020). In this note, we seek to characterize the optimal information design analytically by leveraging the SDP formulation, when the design objective is to maximize social welfare or the agreement among players' action. We show that full information disclosure maximizes social welfare when there is a common payoff state, the payoff dependencies among players' actions are homogeneous, or when the signals are public. When the objective is to maximize the agreement among players' actions, not revealing any information is optimal. When the objective is a weighted combination of social welfare and agreement terms, we establish a threshold weight below which full information disclosure is optimal under public signals for games with homogeneous payoffs. Numerical results corroborate the analytical results, and identify partial information disclosure structures that are optimal.
We consider linear-quadratic-Gaussian (LQG) network games in which agents have quadratic payoffs that depend on their individual and neighbors’ actions, and an unknown payoff-relevant state. An information designer determines the fidelity of information revealed to the agents about the payoff state to maximize the social welfare. Prior results show that full information disclosure is optimal under certain assumptions on the payoffs, i.e., it is beneficial for the average individual. In this paper, we provide conditions for general network structures based on the strength of the dependence of payoffs on neighbors’ actions, i.e., competition, under which a rational agent is expected to benefit, i.e., receive higher payoffs, from full information disclosure. We find that all agents benefit from information disclosure for the star network structure when the game is homogeneous. We also identify that the central agent benefits more than a peripheral agent from full information disclosure unless the competition is strong and the number of peripheral agents is small enough. Despite the fact that all agents expect to benefit from information disclosure ex-ante, a central agent can be worse-off from information disclosure in many realizations of the payoff state under strong competition, indicating that a risk-averse central agent can prefer uninformative signals ex-ante.
In the classical communication setting, multiple senders having access to the same source of information and transmitting it over channel(s) to a receiver, in general, leads to a decrease in estimation error at the receiver. However, if the objectives of the information providers are different from that of the estimator, this might result in interesting strategic interactions. In this work, we consider a hierarchical signaling game between two senders (information designers) and a single receiver (decision maker) each having their own, possibly misaligned, objectives. The senders lead the game by committing to individual information disclosure policies simultaneously, within the framework of a Nash game among themselves. This is followed by the receiver's action decision. With Gaussian information structure and quadratic objectives (which depend on underlying state and receiver's action) for all the players, we show that in general the equilibrium is not unique. While we show that full revelation of the state is always an equilibrium, we propose an algorithm to achieve non trivial equilibria. Through simulations we show that misalignment between senders' objectives is beneficial for the receiver.
Entanglement is of paramount importance in quantum information theory. Its supremacy over classical correlations has been demonstrated in a numerous information theoretic protocols. Here we study possible adequacy of quantum entanglement in Bayesian game theory, particularly in social welfare solution (SWS), a strategy which the players follow to maximize sum of their payoffs. Given a multi-partite quantum state as an advice, players can come up with several correlated strategies by performing local measurements on their parts of the quantum state. A quantum strategy is called quantum-SWS if it is advantageous over a classical equilibrium (CE) strategy in the sense that none of the players has to sacrifice their CE-payoff rather some have incentive and at the same time it maximizes sum of all players' payoffs over all possible quantum advantageous strategies. Quantum state yielding such a quantum-SWS is called a quantum social welfare advice (SWA). We show that any two-qubit pure entangled state, even if it is arbitrarily close to a product state, can serve as quantum-SWA in some Bayesian game. Our result, thus, gives cognizance to the fact that every two-qubit pure entanglement is the best resource for some operational task.
We investigate a privacy-signaling game problem in which a sender with privacy concerns observes a pair of correlated random vectors which are modeled as jointly Gaussian. The sender aims to hide one of these random vectors and convey the other one whereas the objective of the receiver is to accurately estimate both of the random vectors. We analyze these conflicting objectives in a game theoretic framework with quadratic costs where depending on the commitment conditions (of the sender), we consider Nash or Stackelberg (Bayesian persuasion) equilibria. We show that a payoff dominant Nash equilibrium among all admissible policies is attained by a set of explicitly characterized linear policies. We also show that a payoff dominant Nash equilibrium coincides with a Stackelberg equilibrium. We formulate the information bottleneck problem within our Stackelberg framework under the mean squared error distortion criterion where the information bottleneck setup has a further restriction that only one of the random variables is observed at the sender. We show that this MMSE Gaussian Information Bottleneck Problem admits a linear solution which is explicitly characterized in the paper. We provide explicit conditions on when the optimal solutions, or equilibrium solutions in the Nash setup, are informative or noninformative.
We consider a privacy-signaling game problem in which a transmitter with privacy concerns and a receiver, which does not pay attention to these privacy concerns, communicate. In this communication scenario, the transmitter observes a pair of correlated random variables which are modeled as jointly Gaussian. The transmitter constructs its message based on these random variables with the aim to hide one of them and convey the other one. In contrast, the objective of the receiver is to accurately estimate both of the random variables so as to gather as much information as possible. These conflicting objectives are analyzed in a game theoretic framework where depending on the commitment conditions (of the sender), we consider Nash or Stackelberg equilibria. We show that a payoff dominant (i.e., most desirable for both players) Nash equilibrium is attained by affine policies and we explicitly characterize these policies. In addition, the strategies at the characterized Nash equilibrium is shown to form also a Stackelberg equilibrium. Furthermore, we show that there always exists an informative Stackelberg equilibrium for the multidimensional parameter setup. We also revisit the information bottleneck problem within our Stackelberg framework under the mean squared error distortion criterion where the information bottleneck setup has a further restriction that only one of the parameters is observed at the sender. We fully characterize the Stackelberg equilibria under certain conditions and when these conditions are not met we establish the existence of informative equilibria.
We consider a two-player dynamic information design problem for a game played between a principal and a receiver on top of a Markovian system controlled by the receiver’s actions. The principal strategically obtains and shares some information about the underlying system with the receiver in order to influence their actions, and agents’ instantaneous rewards depend only on the system state and receiver actions. In our game, both players have long-term objectives, and the principal sequentially commits to their strategies instead of at the beginning-at every turn the principal can choose randomized experiments to observe the system partially. The principal can share details about the experiments to the receiver. In our analysis the truthful disclosure rule is assumed-the principal is required to truthfully announce each experiment detail and result to the receiver immediately after the result is revealed. Based on the received information, when its their turn the receiver takes an action which influences the state of the underlying system. Using a constructive backward inductive procedure, we show that there exists a Perfect Bayesian Equilibrium in this game where both agents play Canonical Belief Based (CBB) strategies using a compressed version of their information, rather than their full information, to choose experiments (for the principal) or actions (for the receiver).