Decay of invincible clusters of cooperators in the evolutionary prisoner's dilemma game

Two types of invincible clusters of cooperators are defined in the one-dimensional evolutionary Prisoner's Dilemma game. These invincible clusters can either be peaceful or aggressive. The survival of these invincible clusters is discussed in the context of the repeated Prisoner's Dilemma game with imitation and asynchronous updating procedure. The decay rates for these two types of clusters are analyzed numerically, for all enumeration of the configuration for small chain size.We find characteristic difference in the decay patterns of these two types of invincible clusters. The peaceful invincible clusters experience monotonic exponential decay, while the aggressive ones shows an interesting minimum in the density of cooperators before going through a slow exponential decay at long time. A heuristic argument for the existence of the minima is provided. © Springer-Verlag Berlin Heidelberg 2009

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

2015 GREAT Day Program

SUNY Geneseo’s Ninth Annual GREAT Day.https://knightscholar.geneseo.edu/program-2007/1009/thumbnail.jp

Sin, self and society : a theological investigation into structural evil, drawing especially on the works of Thomas Aquinas, Heinz Kohut and Anthony Giddens.

Abstract available in pdf file.Thesis in 2 volumes