Skip Nav Destination
Close Modal
Update search
NARROW
Format
Journal
Date
Availability
1-4 of 4
David B. Fogel
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
Publisher: Journals Gateway
Evolutionary Computation (2023) 31 (2): 157–161.
Published: 01 June 2023
Abstract
View article
PDF
On the occasion of the 30-year anniversary of the Evolutionary Computation journal, I was invited by Professor Hart to offer some reflections on the article on evolving behaviors in the iterated prisoner's dilemma that I contributed to its first issue in 1993. It's an honor to do so. I would like to thank Professor Ken De Jong, the journal's first editor-in-chief, for his vision in creating the journal, and the editors who have followed and maintained that vision. This article contains some personal reflections on the topic and the field as a whole.
Journal Articles
Publisher: Journals Gateway
Evolutionary Computation (1995) 3 (4): 491–495.
Published: 01 December 1995
Abstract
View article
PDF
The effectiveness of intermediate recombination in evolution strategies is analyzed in light of the typical procedure of initializing trial solutions uniformly about the global optimum of benchmark functions. Analysis indicates that this procedure may predispose results in favor of intermediate recombination.
Journal Articles
Publisher: Journals Gateway
Evolutionary Computation (1995) 3 (3): 349–363.
Published: 01 September 1995
Abstract
View article
PDF
Evolutionary programming experiments are conducted to examine the relationship between the durations of encounters and the evolution of cooperative behavior in the iterated prisoner's dilemma. A population of behavioral strategies represented by finite-state machines is evolved over successive generations, with selection made on the basis of individual fitness. Each finite-state machine is given an additional evolvable parameter corresponding to the maximum number of moves it will execute in any encounter. A series of Monte Carlo trials indicates distinct relationships between encounter length and cooperation; however, no causal relationship can be positively identified.
Journal Articles
Publisher: Journals Gateway
Evolutionary Computation (1993) 1 (1): 77–97.
Published: 01 March 1993
Abstract
View article
PDF
Evolutionary programming experiments are conducted to investigate the conditions that promote the evolution of cooperative behavior in the iterated prisoner's dilemma. A population of logical stimulus-response devices is maintained over successive generations with selection based on individual fitness. The reward for selfish behavior is varied across a series of trials. Simulations indicate three distinct patterns of behaviors in which mutual cooperation is inevitable, improbable, or apparently random. The ultimate behavior can be reliably predicted by examining the payoff matrix that defines the reward for alternative joint behaviors.