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:1509.05502

Mutual Information as Privacy-Loss Measure in Strategic Communication

Farhad Farokhi, Girish N. Nair

Published Sep 18, 2015• 0 citations
arXivHTMLPDF

Abstract

A game is introduced to study the effect of privacy in strategic communication between well-informed senders and a receiver. The receiver wants to accurately estimate a random variable. The sender, however, wants to communicate a message that balances a trade-off between providing an accurate measurement and minimizing the amount of leaked private information, which is assumed to be correlated with the to-be-estimated variable. The mutual information between the transmitted message and the private information is used as a measure of the amount of leaked information. An equilibrium is constructed and its properties are investigated.

DOI
10.48550/arxiv.1509.05502

Related papers

Quadratic Gaussian privacy games

Farhad Farokhi, Henrik Sandberg, Iman Shames +1 more

A game-theoretic model for analysing the effects of privacy on strategic communication between agents is devised. In the model, a sender wishes to provide an accurate measurement of the state to a receiver while also protecting its private information (which is correlated with the state) private from a malicious agent that may eavesdrop on its communications with the receiver. A family of nontrivial equilibria, in which the communicated messages carry information, is constructed and its properties are studied.

arXiv:1509.05497•IEEE Conference on Decision and Control (CDC)•Dec 1, 2015•32 citations

Privacy-Constrained Communication**The work of F. Farokhi was supported by a McKenzie Fellowship, ARC grant LP130100605, a grant from Melbourne School of Engineering. The work of G. Nair was supported by ARC grants DP140100819 and FT140100527.

Farhad Farokhi, Girish N. Nair

: A game is introduced to study the effect of privacy in strategic communication between a well-informed sender and a receiver. The receiver wants to accurately estimate a random variable. The sender, however, wants to communicate a message that balances a trade-off between providing an accurate measurement and minimizing the amount of leaked private information, which is assumed to be correlated with the to-be-estimated variable. The mutual information between the transmitted message and the private information is used as a measure of the amount of leaked information. An equilibrium is constructed and its properties are investigated.

IFAC-PapersOnLine•Jan 1, 2016•21 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 Extraction from a Strategic Sender over a Noisy Channel

Anuj S. Vora, Ankur A. Kulkarni

We consider a setting where a receiver tries to perfectly recover a source signal privately known to a sender who can send messages via a noisy channel. However, the sender is compromised and may have an incentive to lie about its information. We formulate the problem as a game between the sender and the receiver and show that there is a strategy for the receiver in which it can recover an exponential number of signals. We define a notion of a sender graph and the information extraction capacity of the sender which quantifies the maximum amount of information that can be extracted from the sender. We also show that the rate of information extraction is given by the minimum of the information extraction capacity of the sender and the zero-error capacity of the noisy channel.

IEEE Conference on Decision and Control (CDC)•Dec 14, 2020•17 citations

Gaussian cheap talk game with quadratic cost functions: When herding between strategic senders is a virtue

Farhad Farokhi, Andre M. H. Teixeira, Cédric Langbort

We consider a Gaussian cheap talk game with quadratic cost functions. The cost function of the receiver is equal to the estimation error variance, however, the cost function of each senders contains an extra term which is captured by its private information. Following the cheap talk literature, we model this problem as a game with asymmetric information. We start by the single sender case in which the receiver also has access to a noisy but honest side information in addition to the message transmitted by a strategic sender. We generalize this setup to multiple sender case. For the multiple sender case, we observe that if the senders are not herding (i.e., copying each other policies), the quality of the receiver's estimation degrades rapidly as the number of senders increases.

arXiv:1402.4031•Proceedings of the ... American Control Conference/Proceedings of the American Control Conference•Jun 1, 2014•11 citations

Value of Information in Games With Multiple Strategic Information Providers

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 as compared with the single sender case. However, if the objectives of the information providers are different from that of the estimator, this might result in interesting strategic interactions and outcomes. In this work, we consider a hierarchical signaling game between multiple 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 non-cooperative Nash game among themselves. This is followed by the receiver's action decision. With Gaussian information structure and quadratic objectives (which depend on the underlying state and receiver's action) for all the players, we show that in general the equilibrium is not unique. We hence identify a set of equilibria and further show that linear noiseless policies can achieve a minimal element of this set. Additionally, we show that competition among the senders is beneficial to the receiver, as compared with cooperation among the senders. Further, we extend our analysis to a dynamic signaling game of finite horizon with Markovian information evolution. We show that linear memoryless policies can achieve equilibrium in this dynamic game. We also consider an extension to a game with multiple receivers having coupled objectives. We provide algorithms to compute the equilibrium strategies in all these cases. Finally, via extensive simulations, we analyze the effects of multiple senders in varying degrees of alignment among their objectives.

arXiv:2306.14886•IEEE Transactions on Automatic Control•Jan 10, 2025•5 citations
A game is introduced to study the effect of privacy in strategic communication between well-informed senders and a receiver. The receiver wants to accurately estimate a random variable. The sender, however, wants to communicate a message that balances a trade-off between providing an accurate measurement and minimizing the amount of leaked private information, which is assumed to be correlated with the to-be-estimated variable. The mutual information between the transmitted message and the private information is used as a measure of the amount of leaked information. An equilibrium is constructed and its properties are investigated.
A game-theoretic model for analysing the effects of privacy on strategic communication between agents is devised. In the model, a sender wishes to provide an accurate measurement of the state to a receiver while also protecting its private information (which is correlated with the state) private from a malicious agent that may eavesdrop on its communications with the receiver. A family of nontrivial equilibria, in which the communicated messages carry information, is constructed and its properties are studied.
: A game is introduced to study the effect of privacy in strategic communication between a well-informed sender and a receiver. The receiver wants to accurately estimate a random variable. The sender, however, wants to communicate a message that balances a trade-off between providing an accurate measurement and minimizing the amount of leaked private information, which is assumed to be correlated with the to-be-estimated variable. The mutual information between the transmitted message and the private information is used as a measure of the amount of leaked information. An equilibrium is constructed and its properties are investigated.
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 setting where a receiver tries to perfectly recover a source signal privately known to a sender who can send messages via a noisy channel. However, the sender is compromised and may have an incentive to lie about its information. We formulate the problem as a game between the sender and the receiver and show that there is a strategy for the receiver in which it can recover an exponential number of signals. We define a notion of a sender graph and the information extraction capacity of the sender which quantifies the maximum amount of information that can be extracted from the sender. We also show that the rate of information extraction is given by the minimum of the information extraction capacity of the sender and the zero-error capacity of the noisy channel.
We consider a Gaussian cheap talk game with quadratic cost functions. The cost function of the receiver is equal to the estimation error variance, however, the cost function of each senders contains an extra term which is captured by its private information. Following the cheap talk literature, we model this problem as a game with asymmetric information. We start by the single sender case in which the receiver also has access to a noisy but honest side information in addition to the message transmitted by a strategic sender. We generalize this setup to multiple sender case. For the multiple sender case, we observe that if the senders are not herding (i.e., copying each other policies), the quality of the receiver's estimation degrades rapidly as the number of senders increases.
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 as compared with the single sender case. However, if the objectives of the information providers are different from that of the estimator, this might result in interesting strategic interactions and outcomes. In this work, we consider a hierarchical signaling game between multiple 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 non-cooperative Nash game among themselves. This is followed by the receiver's action decision. With Gaussian information structure and quadratic objectives (which depend on the underlying state and receiver's action) for all the players, we show that in general the equilibrium is not unique. We hence identify a set of equilibria and further show that linear noiseless policies can achieve a minimal element of this set. Additionally, we show that competition among the senders is beneficial to the receiver, as compared with cooperation among the senders. Further, we extend our analysis to a dynamic signaling game of finite horizon with Markovian information evolution. We show that linear memoryless policies can achieve equilibrium in this dynamic game. We also consider an extension to a game with multiple receivers having coupled objectives. We provide algorithms to compute the equilibrium strategies in all these cases. Finally, via extensive simulations, we analyze the effects of multiple senders in varying degrees of alignment among their objectives.