Information geometry of influence diagrams and noncooperative games

What is the "value of information" in non-cooperative games with imperfect information? To answer this question, we propose to quantify information using concepts from Shannon's information theory. We then relate quantitative changes to the information structure of a game to changes in the expected utility of the players. Our approach is based on the Multi-Agent Influence Diagram representation of games. We develop a generalization of the concept of marginal utility in decision scenarios to apply to infinitesimal changes of the channel parameters in noncooperative games. Using that framework we derive general conditions for negative value of information, and show that generically, these conditions hold in all games unless one imposes a priori constraints on the allowed changes to information channels. In other words, in any game in which a player values some aspect of the game's specification beyond the information provided in that game, there will be an infinitesimal change to the parameter vector specifying the game that increases the information but hurts the player. Furthermore, we derive analogous results for N > 1 players, i.e., state general conditions for negative value of information simultaneously for all players. We demonstrate these results numerically on a decision problem as well as a leader-follower game and discuss their general implications.

[1]  Shun-ichi Amari,et al.  Methods of information geometry , 2000 .

[2]  K. Bagwell Commitment and observability in games , 1995 .

[3]  Ronald A. Howard,et al.  Influence Diagram Retrospective , 2005, Decis. Anal..

[4]  L. Goddard Information Theory , 1962, Nature.

[5]  Drew Fudenberg,et al.  Game theory (3. pr.) , 1991 .

[6]  Daphne Koller,et al.  Multi-Agent Influence Diagrams for Representing and Solving Games , 2001, IJCAI.

[7]  J. Ponssard,et al.  The values of information in some nonzero sum games , 1977 .

[8]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[9]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[10]  M. Leshno,et al.  An elementary proof of Blackwell's theorem , 1992 .

[11]  Nir Friedman,et al.  Probabilistic Graphical Models , 2009, Data-Driven Computational Neuroscience.

[12]  Stephen Morris,et al.  The Comparison of Information Structures in Games: Bayes Correlated Equilibrium and Individual Sufficiency , 2013 .

[13]  Yifeng Zeng,et al.  Graphical models for interactive POMDPs: representations and solutions , 2009, Autonomous Agents and Multi-Agent Systems.

[14]  Eckehard Olbrich,et al.  Hysteresis Effects of Changing Parameters of Noncooperative Games , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  D. Blackwell Equivalent Comparisons of Experiments , 1953 .

[16]  Olivier Gossner,et al.  Ability and knowledge , 2010, Games Econ. Behav..

[17]  J. Jost Riemannian geometry and geometric analysis , 1995 .