Cooperation and Coordination in a Networked Society

Cooperation and coordination are notoriously difficult goals to achieve. Using basic evolutionary game theory, it can be shown that cooperation is typically doomed, while coordination on inferior Pareto equilibria is commonplace. However, these results are based on mixing populations in which interactions may happen between any pair or group of agents. In this talk it will be shown that, if one takes into account the typical social networks structures that permeates society, the prospects are less gloomy and socially efficient steady states may be achieved.
Marco Tomassini is a professor of Computer Science at the Information Systems Department of the Business and Economics Faculty of the University of Lausanne, Switzerland. He graduated in physical and chemical sciences and obtained a Doctorate in theoretical chemistry from the Universit... condensed matter systems. After some years in crystal and molecular physics research, he switched to computer science, with particular interest in the fields of parallel computing and cellular automata modeling. His current research interests are centered around the application of biological ideas to artificial systems and the network dimension of complex systems. He is active in evolutionary computation, especially spatially structured systems, genetic programming, and the structure of hard combinatorial search spaces. He is also active in evolutionary games on networks and the evolution of coordination and cooperation, including the dynamical properties of networked complex systems. He has been Program Chair of several international events and has published more than 230 scientific papers and several authored and edited books in these fields.
Source: evostar 2012
![]() |
Lattice-Gas Cellular Automata: Simple Models of Complex Hydrodynamics (Collection Alea-Saclay: Monographs and Texts in Statistical Physics) Book (Cambridge University Press) |
You might also like:



Complexity lab manual table contents part 2
JJ) John Horton Conway's game of life:
PPPP) game of Go
TTT) Look at Tierra! how cell automata can EVOLVE!
YYY) cell automata with NON local rules
UUU) cell automata with random input
XXX) prime numbers, fibos
QQQ) classification of finite simple groups
RRR) Xnew=mXold(1-Xold) and Mandelbrot set
OOOO) talk about analog/digital
NNNN) now comp...s
AI reasoning vs trial and error, knowlege representation
Cellular Automata/Dynamical systems
Mathematical structures primes, fibos, groups
Auto Repair
Chemistry
Organic Chemistry
Minerology
Geology
Bateson's Mind and Nature
A Computable Universe - Roger Penrose On Nature As Computation — iProgrammer
Following on from the recent ten-year anniversary of the publication of Steven Wolfram's A New Kind of Science, we have an other "big book" on how …
![]() |
Lattice-Gas Cellular Automata: Simple Models of Complex Hydrodynamics (Collection Alea-Saclay: Monographs and Texts in Statistical Physics) ( Paperback ) by Rothman, Daniel H.; Zaleski, Stiphane published by Cambridge University Press Book (Cambridge University Press) |



![]() |
Telecom Mediation Software for all Switch Types - Call 800-544-8874Cellular Automata in Complex Matter. Dominique Désérable Pascal Dupont. |



Related posts:
- Cellular automata as models of complexity
- Cellular automata models application
- Cellular automata models collection
Nov 08, 2024 by thebolivianrock | Posted in Programming & Design
We are currently working with arrays in class and now I have a programming assignment where I need to model the Rule 30 cellular Automaton. My teacher gave us the basic skeleton file for this assignment but I am completel …s with right now. I only posted all of the other stuff for more insight. Thanks again! TO Modulo: So I fixed what you told me and now I am getting an error saying: In function main(): undefined reference to printRow()
I feel bad for doing your homework for you, but the problem piqued my interest. include <iostream> #include <cstdlib> using namespace std; void setupRow(); void printRow(); void updateRow(); int findNextCellSt …s. // The states for this are: // // 111 110 101 100 011 010 001 000 // 0 0 0 1 1 1 1 0 int findNextCellState(int left_neighbor, int cell, int right_neighbor) { return NextCellState[left_neighbor][cell][right_neighbor]; }