Decision Support Systems - From information retrieval to knowledge management: enabling technologies and best practices
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Successive State Transitions with I/O Interface by Molecules
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Journal of Management Information Systems - Special section: Information technology and its organizational impact
Artificial Agents for Discovering Business Strategies for Network Industries
International Journal of Electronic Commerce
Genetic algorithms, selection schemes, and the varying effects of noise
Evolutionary Computation
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
A PNA-mediated Whiplash PCR-based Program for In Vitro Protein Evolution
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Experimental validation and optimization of signal dependent operation in whiplash PCR
Natural Computing: an international journal
Displacement whiplash PCR: optimized architecture and experimental validation
DNA'06 Proceedings of the 12th international conference on DNA Computing
A DNA based evolutionary algorithm for the minimal set cover problem
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
A bayesian algorithm for in vitro molecular evolution of pattern classifiers
DNA'04 Proceedings of the 10th international conference on DNA computing
| Hi-index | 0.00 |
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.