In this paper, we propose a new very simple mechanism supporting the emergence of cooperation in a population of memoryless agents playing a prisoner’s dilemma game. Each agent belongs to a community and interacts with the agents of its community and with the agents belonging to linked communities. A simple rule governs the dynamics of the system: a community grows (resp. decreases) if the aver...

1Program for Evolutionary Dynamics, Harvard University, Cambridge, MA 02138 2Center of Mathematical Sciences and Applications, Harvard University, Cambridge, MA 02138 3Department of Mathematics, University of Tennessee, Knoxville, TN 37996 4Department of Mathematics, University of British Columbia, 1984 Mathematics Road, Vancouver, BC, Canada V6T 1Z2 5Department of Mathematics, Harvard Universi...

A new approach has been introduced to construct deformation-mechanism maps for metals and solid solution alloys. For this purpose two computer programs named DEFOR and GRAPH have been written in BASIC to be run on IBM compatible personal computers. Using these programs, deformation - mechanism maps for a number of pure metals and a solid solution alloy (Ti-6wt% Al) have been plotted and effects...

We introduce a framework within evolutionary game theory for studying the distinction between objective and subjective rationality and apply it to the evolution of cooperation on 3-regular random graphs. In our simulations, agents evolve misrepresentations of objective reality that help them cooperate and maintain higher social welfare in the Prisoner’s dilemma. These agents act rationally on t...

This study was performed to determine the usefulness of the intercellular metabolic cooperation assay for analysis of a complex mixture and to compare the results obtained with previously conducted in vivo tumor promoter assays. One hundred 2R1 cigarettes were smoked according to Federal Trade Commission guidelines and the resulting condensate was separated into a water/methanol-soluble fractio...

We present a distributed garbage collection algorithm that eventually collects all cycles in an open network. As with recent reference counting algorithms, it explicitly maintain the distributed inverse reference graph (i.e., each object maintains a list of sites known to have references to it). We show that a modiied depth-rst traversal of this inverse graph is suucient to locate any garbage i...

Let $R$ be a ring with unity. The undirected nilpotent graph of $R$, denoted by $Gamma_N(R)$, is a graph with vertex set ~$Z_N(R)^* = {0neq x in R | xy in N(R) for some y in R^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in N(R)$, or equivalently, $yx in N(R)$, where $N(R)$ denoted the nilpotent elements of $R$. Recently, it has been proved that if $R$ is a left A...

Investigating the evolutionary dynamics of game theoretical interactions in populations where individuals are arranged on a graph can be challenging in terms of computation time. Here, we propose an efficient method to study any type of game on arbitrary graph structures for weak selection. In this limit, evolutionary game dynamics represents a first-order correction to neutral evolution. Spati...

The emergence and evolution of cooperation in complex natural, social and economical systems is an interdisciplinary topic of recent interest. This paper focuses on the cooperation on complex networks using the approach of evolutionary games. In particular, the phenomenon of diversityoptimized cooperation is briefly reviewed and the effect of network clustering on cooperation is treated in deta...

A major component of computer chip design is creating an optimal physical layout of a netlist, i.e., determining where to place the functional elements and how to route the wires connecting them when manufacturing a chip. Because of its basic structure, the overall problem of netlist layout contains many questions that lend themselves to graph theoretical modeling and analysis. We will describe...