DNA Starts to Learn Poker

DNA is used to implement a simplified version of poker. Strategies are evolved that mix bluffing with telling the truth. The essential features are (1) to wait your turn, (2) to default to the most conservative course, (3) to probabilistically override the default in some cases, and (4) to learn from payoffs. Two players each use an independent population of strategies that adapt and learn from their experiences in competition.

[1]  Joerg joke Heitkoetter,et al.  The hitch-hiker''s guide to evolutionary computation , 2001 .

[2]  Eric B. Baum,et al.  DNA based computers II : DIMACS workshop, June 10-12, 1996 , 1999 .

[3]  D. Labie,et al.  Molecular Evolution , 1991, Nature.

[4]  A. Copeland.  Review: John von Neumann and Oskar Morgenstern, Theory of games and economic behavior , 1945 .

[5]  James Kennedy,et al.  Proceedings of the 1998 IEEE International Conference on Evolutionary Computation [Book Review] , 1999, IEEE Transactions on Evolutionary Computation.

[6]  David Harlan Wood,et al.  DNA Implementation of a Royal Road Fitness Evaluation , 2000, DNA Computing.

[7]  R. Deaton,et al.  A DNA based implementation of an evolutionary search for good encodings for DNA computation , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[8]  Masami Hagiya,et al.  Towards parallel evaluation and learning of Boolean μ-formulas with molecules , 1997, DNA Based Computers.

[9]  David Harlan Wood,et al.  A new DNA separation technique with a low error rate , 1997, DNA Based Computers.

[10]  Jörgen W. Weibull,et al.  Evolutionary Game Theory , 1996 .

[11]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[12]  Walter Cedeño,et al.  In vitro selection for a OneMax DNA evolutionary computation , 1999, DNA Based Computers.

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[14]  Walter Cedeño,et al.  A design for DNA computation of the OneMax problem , 2001, Soft Comput..

[15]  D. Wood,et al.  Computation with biomolecules. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Garett O. Dworman,et al.  On Automated Discovery of Models Using Genetic Programming: Bargaining in a Three-Agent Coalitions Game , 1995, J. Manag. Inf. Syst..

[17]  Jules Moreau,et al.  Molecular Computation by DNA Hairpin Formation , 2000 .

[18]  L. S. Shapley,et al.  10. A SIMPLE THREE-PERSON POKER GAME , 1951 .

[19]  W. Stemmer,et al.  Searching Sequence Space , 1995, Bio/Technology.

[20]  Dong-Jun Wu.  Artificial Agents for Discovering Business Strategies for Network Industries , 2000, Int. J. Electron. Commer..

[21]  Garett O. Dworman,et al.  On automated discovery of models using genetic programming in game-theoretic contexts , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[22]  Parag A. Pathak,et al.  Massachusetts Institute of Technology , 1964, Nature.

[23]  W. Stemmer.  DNA shuffling by random fragmentation and reassembly: in vitro recombination for molecular evolution. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[24]  N. Seeman,et al.  Synthesis from DNA of a molecule with the connectivity of a cube , 1991, Nature.

[25]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[26]  N. Seeman,et al.  Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.

[27]  L. Samuelson.  Evolutionary Games and Equilibrium Selection , 1997 .

[28]  Thomas Pellizzari,et al.  Non-Standard Computation , 1997 .

[29]  C. Lee Giles,et al.  Accessibility of information on the web , 1999, Nature.

[30]  J M Smith,et al.  Evolution and the theory of games , 1976 .

[31]  David Harlan Wood,et al.  DNA based computers III : DIMACS Workshop, June 23-25, 1997 , 1999 .

[32]  Philippe Giguere.  Population Sizing for Optimum Sampling with Genetic Algorithms: A Case Study of the Onemax Problem , 1998 .

[33]  Jeffrey Horn,et al.  Handbook of evolutionary computation , 1997 .

[34]  Neocles B. Leontis,et al.  The control of DNA structure: From topological modules to geometrical modules , 1997 .

[35]  Walter Cedeño,et al.  A DNA implementation of the Max 1s problem , 1999 .

[36]  M. Vose.  The Simple Genetic Algorithm , 1999 .

[37]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[38]  J C Cox,et al.  Automated RNA Selection , 1998, Biotechnology progress.

[39]  K Sakamoto,et al.  Molecular computation by DNA hairpin formation. , 2000, Science.

[40]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[41]  Ribozymes in Wonderland , 1997, Science.

[42]  Masami Hagiya,et al.  Successive State Transitions with I/O Interface by Molecules , 2000, DNA Computing.

[43]  David E. Goldberg,et al.  Genetic Algorithms, Selection Schemes, and the Varying Effects of Noise , 1996, Evolutionary Computation.

[44]  Hitoshi Iba,et al.  Genetic Programming 1998: Proceedings of the Third Annual Conference , 1999, IEEE Trans. Evol. Comput..

[45]  Steven O. Kimbrough,et al.  Bargaining by artificial agents in two coalition games: a study in genetic programming for electronic commerce , 1996 .

[46]  J. S. McCaskill,et al.  In vitro DNA-based predator-prey system with oscillatory kinetics , 1998 .

[47]  Lloyd M. Smith,et al.  DNA computing on surfaces , 2000, Nature.

[48]  David Harlan Wood.  A DNA Computing Algorithm for Directed Hamiltonian Paths , 1998 .

[49]  E. Winfree.  Whiplash PCR for O(1) Computing , 1998 .

[50]  D. Wood,et al.  DNA Computing Implementing Genetic Algorithms , 1999 .

[51]  L F Landweber,et al.  Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

[52]  Ronald M. Lee,et al.  Formal Aspects of Electronic Commerce: Research Issues and Challenges , 1997, Int. J. Electron. Commer..

[53]  Gerald F. Joyce,et al.  Selection in vitro of an RNA enzyme that specifically cleaves single-stranded DNA , 1990, Nature.

[54]  David Harlan Wood,et al.  Exascale computer algebra problems interconnect with molecular reactions and complexity theory , 1996, DNA Based Computers.

[55]  Yinli Wang,et al.  The Control of Dna Structure and Topology: An Overview , 1994 .

[56]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[57]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[58]  M. Hagiya,et al.  State transitions by molecules. , 1999, Bio Systems.

[59]  D. J. Wu,et al.  Discovering near-optimal pricing strategies for the deregulated electric power marketplace using genetic algorithms , 1999, Decis. Support Syst..

[60]  Thomas Bäck,et al.  Evolutionary Computation as a Paradigm for DNA-Based Computing , 2002 .

[61]  J. Reif,et al.  Logical computation using algorithmic self-assembly of DNA triple-crossover molecules , 2000, Nature.

[62]  Christos H. Papadimitriou,et al.  Algorithms, Games, and the Internet , 2001, ICALP.

[63]  Nadrian C. Seeman,et al.  Construction of DNA Polyhedra and Knots Through Symmetry Minimization , 1995 .

[64]  Hui Wang,et al.  The perils of polynucleotides: The experimental gap between the design and assembly of unusual DNA structures , 1996, DNA Based Computers.