On the Price of Transparency: A Comparison between Overt Persuasion and Covert Signaling

03/31/2023
by   Tao Li, et al.
0

Transparency of information disclosure has always been considered an instrumental component of effective governance, accountability, and ethical behavior in any organization or system. However, a natural question follows: what is the cost or benefit of being transparent, as one may suspect that transparency imposes additional constraints on the information structure, decreasing the maneuverability of the information provider. This work proposes and quantitatively investigates the price of transparency (PoT) in strategic information disclosure by comparing the perfect Bayesian equilibrium payoffs under two representative information structures: overt persuasion and covert signaling models. PoT is defined as the ratio between the payoff outcomes in covert and overt interactions. As the main contribution, this work develops a bilevel-bilinear programming approach, called Z-programming, to solve for non-degenerate perfect Bayesian equilibria of dynamic incomplete information games with finite states and actions. Using Z-programming, we show that it is always in the information provider's interest to choose the transparent information structure, as 0≤PoT≤ 1. The upper bound is attainable for any strictly Bayesian-posterior competitive games, of which zero-sum games are a particular case. For continuous games, the PoT, still upper-bounded by 1, can be arbitrarily close to 0, indicating the tightness of the lower bound. This tight lower bound suggests that the lack of transparency can result in significant loss for the provider. We corroborate our findings using quadratic games and numerical examples.

READ FULL TEXT
research
05/10/2019

Perfect Prediction in Minkowski Spacetime: Perfectly Transparent Equilibrium for Dynamic Games with Imperfect Information

The assumptions of necessary rationality and necessary knowledge of stra...
research
07/11/2023

Iterated Elimination of Weakly Dominated Strategies in Well-Founded Games

Recently, in [K.R. Apt and S. Simon: Well-founded extensive games with p...
research
09/27/2020

The Power of Signaling and its Intrinsic Connection to the Price of Anarchy

A basic lesson from game theory is that strategic behavior often renders...
research
07/28/2020

Simple combinatorial auctions with budget constraints

We study the efficiency of simple combinatorial auctions for the allocat...
research
02/13/2020

Sensitivity of Wardrop Equilibria: Revisited

For single-commodity networks, the increase of the price of anarchy is b...
research
05/14/2020

Comparison of Information Structures for Zero-Sum Games and a Partial Converse to Blackwell Ordering in Standard Borel Spaces

In statistical decision theory involving a single decision-maker, one sa...
research
02/20/2023

Achieving Hierarchy-Free Approximation for Bilevel Programs With Equilibrium Constraints

In this paper, we develop an approximation scheme for solving bilevel pr...

Please sign up or login with your details

Forgot password? Click here to reset