What Information Theory Says About Best Response and About Binding Contracts

Product Distribution (PD) theory is the information-theoretic extension of conventional full- rationality game theory to bounded rational games. Here PD theory is used to investigate games in which the players use bounded rational best-response strategies. This investigation illuminates how to determine the optimal organization chart for a corporation, or more generally how to order the sequence of moves of the players / employees so as to optimize an overall objective function. It is then shown that in the continuum-time limit, bounded rational best response games result in a variant of the replicator dynamics of evolutionary game theory. This variant is then investigated for team games, in which the players share the same utility function, by showing that such continuum- limit bounded rational best response is identical to Newton-Raphson iterative optimization of the shared utility function. Next PD theory is used to investigate changing the coordinate system of the game, i.e., changing the mapping from the joint move of the players to the arguments in the utility functions. Such a change couples those arguments, essentially by making each players move be an offered binding contract.

[1]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[2]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[3]  M. Tanner,et al.  Ecological Inference: New Methodological Strategies , 2004 .

[4]  M. Rehm,et al.  Proceedings of AAMAS , 2005 .

[5]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[6]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[7]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[8]  Shigeo Abe DrEng.  Pattern Classification , 2001, Springer London.

[9]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[10]  Jeff S. Shamma,et al.  Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria , 2005, IEEE Transactions on Automatic Control.

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

[12]  E. Jaynes.  Probability theory : the logic of science , 2003 .

[13]  S. Hart,et al.  Handbook of Game Theory with Economic Applications , 1992 .

[14]  Economics Letters , 2022 .

[15]  W. Hamilton,et al.  The Evolution of Cooperation , 1984 .

[16]  Michael I. Jordan,et al.  Advances in Neural Information Processing Systems 30 , 1995 .

[17]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[18]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

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

[20]  Achim G. Hoffmann,et al.  Proceedings of the Nineteenth International Conference on Machine Learning , 2002 .

[21]  Physical Review , 1965, Nature.

[22]  D. Fudenberg,et al.  The Theory of Learning in Games , 1998 .

[23]  Stefan R. Bieniawski,et al.  Adaptive Multi-Agent Systems for Constrained Optimization , 2004 .

[24]  Thomas G. Dietterich,et al.  In Advances in Neural Information Processing Systems 12 , 1991, NIPS 1991.