Conversion/Preference Games

We introduce the concept of Conversion/Preference Games, or CP games for short. CP games generalize the standard notion of strategic games. First we exemplify the use of CP games. Second we formally introduce and define the CP-games formalism. Then we sketch two `real-life' applications, namely a connection between CP games and gene regulation networks, and the use of CP games to formalize implied information in Chinese Wall security. We end with a study of a particular fixed-point construction over CP games and of the resulting existence of equilibria in possibly infinite games.

[1]  R. Thomas,et al.  Boolean formalization of genetic control circuits. , 1973, Journal of theoretical biology.

[2]  Mark Ptashne,et al.  A Genetic Switch, Phage Lambda Revisited , 2004 .

[3]  Allen Van Gelder,et al.  Computer Algorithms: Introduction to Design and Analysis , 1978 .

[4]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Michael J. Nash,et al.  The Chinese Wall security policy , 1989, Proceedings. 1989 IEEE Symposium on Security and Privacy.

[6]  M. Nowak,et al.  Evolutionary Dynamics of Biological Games , 2004, Science.

[7]  R. Thomas,et al.  Dynamical behaviour of biological regulatory networks--II. Immunity control in bacteriophage lambda. , 1995, Bulletin of mathematical biology.

[8]  M. Ptashne,et al.  Genes and Signals , 2001 .

[9]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[10]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..