Rationality meets the tribe: Some models of cultural group selection David Hales, The Open University www.davidhales.com Hales, D., (2010) Rationality.

Slides:



Advertisements
Similar presentations
Evolving Cooperation in the N-player Prisoner's Dilemma: A Social Network Model Dept Computer Science and Software Engineering Golriz Rezaei Michael Kirley.
Advertisements

Solving Collective Commons Problems: Future Scenarios for P2P Finance David Hales, University of Szeged, Hungary Diversity in Macro.
EC – Tutorial / Case study Iterated Prisoner's Dilemma Ata Kaban University of Birmingham.
Institutions and the Evolution of Collective Action Mark Lubell UC Davis.
The Evolution of Cooperation Shade Shutters School of Life Sciences & Center for Environmental Studies.
Chapter 16: Evolution and Human Behavior Minds/brains are products of Natural Selection Evolutionary Psychology Human Universals Evolution of Culture Human.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
Simulation Models as a Research Method Professor Alexander Settles.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Segregation and Neighborhood Interaction Work in progress Jason Barr, Rutgers Newark Troy Tassier, Fordham October 31, 2006.
Conference title 1 A Few Bad Apples Are Enough. An Agent-Based Peer Review Game. Juan Bautista Cabotà, Francisco Grimaldo (U. València) Lorena Cadavid.
Genetic Algorithm.
University of Bologna, Italy How to cheat BitTorrent and why nobody does Simon Patarin and David Hales University of Bologna ECCS 2006,
Project funded by the Future and Emerging Technologies arm of the IST Programme Recent directions in DELIS / Overview of on-going work David Hales
Cooperation through the endogenous evolution of social structure David Hales & Shade Shutters The Open University & Arizona State University
5. Alternative Approaches. Strategic Bahavior in Business and Econ 1. Introduction 2. Individual Decision Making 3. Basic Topics in Game Theory 4. The.
Learning in Multiagent systems
Project funded by the Future and Emerging Technologies arm of the IST Programme Cooperation with Strangers David Hales Department of.
Linking multi-agent simulation to experiments in economy Re-implementing John Duffy’s model of speculative learning agents.
Example Department of Computer Science University of Bologna Italy ( Decentralised, Evolving, Large-scale Information Systems (DELIS)
Engineering with Sociological Metaphors: Examples and Prospects University of Bologna This work is partially supported by the European.
SLAC and SLACER: Simple copy & rewire algorithms for trust and cooperation in P2P David Hales, Stefano Arteconi, Ozalp Babaoglu University of Bologna,
Project funded by the Future and Emerging Technologies arm of the IST Programme Socially Inspired Approaches to Evolving Cooperation David Hales
Can Tags Build Working Systems? From MABS to ESOA Attempting to apply results gained from Multi-Agent- Based Social Simulation (MABSS)
P2P Interaction in Socially Intelligent ICT David Hales Delft University of Technology (Currently visiting University of Szeged, Hungary)
Multi-Patch Cooperative Specialists With Tags Can Resist Strong Cheaters, Bruce Edmonds, Feb 2013, ECMS 2013, Aalesund, Norway, slide 1 Multi-Patch Cooperative.
Evolving networks for cooperation Dagstuhl CCT3 DELIS Workshop Sept 3rd-4th 2005 Presented by David Hales University of Bologna, Italy
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.
You are all social scientists: you just don’t know it yet David Hales (University of Bologna, Italy) SASO 2007, Cambridge. Mass.
Putting “tags” to work Attempting to apply results gained from agent- based social simulation (ABSS) to MAS. Dr David Hales
David Hales (University of Bologna) University of Bologna, Italywww.davidhales.com WARNING! Superficial sociological interpretation followed by simplistic.
Emergent Group-Like Selection in a Peer-to-Peer Network ECCS Conference Paris, Nov. 16 th, 2005 David Hales University of Bologna, Italy
Evolving cooperation in one-time interactions with strangers Tags produce cooperation in the single round prisoner’s dilemma and it’s.
Evolving Social Rationality for MAS using “Tags” Trying to “make things work” by applying results gained from Agent-Based Social Simulation.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
Project funded by the Future and Emerging Technologies arm of the IST Programme From Selfish Nodes to Cooperative Networks – Emergent Link-based Incentives.
Project funded by the Future and Emerging Technologies arm of the IST Programme Understanding “tag” systems by comparing “tag” models David Hales
The Evolution of Specialisation in Groups – Tags (again!) David Hales Centre for Policy Modelling, Manchester Metropolitan University, UK.
1. Genetic Algorithms: An Overview 4 학습목표 GA 의 기본원리를 파악하고, Prisoner’s dilemma 와 sorting network 에의 응용 및 이론적 배경을 이해한 다.
Socially Inspired Computing Engineering with Social Metaphors.
Evolving P2P overlay networks with Tags, SLAC and SLACER for Cooperation and possibly other things… Saarbrücken SP6 workshop July 19-20th 2005 Presented.
Project funded by the Future and Emerging Technologies arm of the IST Programme Altruism “for free” using Tags David Hales Department.
Evolving Strategies for the Prisoner’s Dilemma Jennifer Golbeck University of Maryland, College Park Department of Computer Science July 23, 2002.
Simple Rewire Protocols for Cooperation in Dynamic Networks David Hales, Stefano Arteconi, Ozalp Babaoglu University of Bologna, Italy Bio-Inspired Workshop,
Social Simulation for Self-* Systems: An idea whose time has come? David Hales University of Bologna, Italy In collaboration with: Stefano.
Evolving Specialisation, Altruism & Group-Level Optimisation Using Tags – The emergence of a group identity? David Hales Centre for Policy Modelling, Manchester.
Evolving Specialisation, Altruism & Group-Level Optimisation Using Tags David Hales Centre for Policy Modelling, Manchester Metropolitan University, UK.
Project funded by the Future and Emerging Technologies arm of the IST Programme Change your tags fast! - A necessary condition for cooperation? David Hales.
Where to look and why? : Utility and heuristics as explanations of cooperation in one-shot PD games Shigehito Tanida & Toshio Yamagishi Hokkaido University.
Evolution of Cooperation in Mobile Ad Hoc Networks Jeff Hudack (working with some Italian guy)
Emergent Group Selection: Tags, Networks and Society David Hales, The Open University ASU, Thursday, November 29th For more details.
Novel Models of Group Selection in Social Structures and Networks David Hales University of Bologna, Italy In collaboration with: Stefano.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Introduction to Genetic Algorithms
Game Theory and Cooperation
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
The Matching Hypothesis
Evolution for Cooperation
COEVOLUTION of COOPERATION and SELECTIVE INTERACTION -AN EXPERIMENT-
Socially Inspired Approaches to Evolving Cooperation
Group Selection Design Pattern
Self-Organising, Open and Cooperative P2P Societies – From Tags to Networks David Hales Department of Computer Science University of.
Evolution for Cooperation
Altruism “for free” using Tags
Evolving cooperation in one-time interactions with strangers
1. Genetic Algorithms: An Overview
A Gentle introduction Richard P. Simpson
Presentation transcript:

Rationality meets the tribe: Some models of cultural group selection David Hales, The Open University Hales, D., (2010) Rationality meets the Tribe: Recent Models of Cultural Group Selection. In Mollona, E., (ed) Computational Analysis of Firms’ Organization and Strategic Behaviour. London and New York: Routledge

Models? Abstract models / artificial societies Agent based modeling Thought experiments Not empirically verified / or applied Relax assumptions of traditional game theory / rational action approach Copying (replication) and limited innovation (mutation) => cultural evolution? “Emergent” macro outcomes Focus on social dilemma / public goods type scenarios

Assumptions Agents interact producing individual payoffs (e.g. Prisoner’s Dilemma game) Agent action determined by a trait (e.g. cooperate or defect) Agents select interaction partners based on further trait defining an “in-group” Traits can be copied and mutated Agents tend to copy traits that produce higher individual payoffs Evolutionary game theory

Figure 1. Traditionally, game theory models have focused on agents with unbounded rationality and complete information. The cultural group selection models presented here focus on highly bounded rationality and incomplete information.

Figure 2. Cultural group selection models also differ from the traditional game theory approach in their focus on social learning and (often emergent) social utility over individual utility.

Figure 3. The cultural group selection models represent interactions within dynamic social structures whereas game theory has tended towards static “mean field” structures.

Figure 4. Schematic of the evolution of groups in the tag model. Three generations (a-c) are shown. White individuals are pro-social, black are selfish. Individuals sharing the same tag are shown clustered and bounded by large circles. Arrows indicate group linage. Migration between groups is not shown.

Figure 5. Schematic of the evolution of groups (cliques) in the network- rewiring model. Three generations (a-c) are shown. White individuals are pro-social, black are selfish. Arrows indicate group linage. Notice the similarity to the tag model in figure 4.

Figure 6. Schematic of the evolution of groups in the group-splitting model. Three generations (a-c) are shown. White individuals are pro-social, black are selfish. Individuals sharing the same group are shown clustered and bounded by large circles. Arrows indicate group linage. Migration between groups is not shown.

What are tags Tags are observable labels, markings or social cues Agents can observe tags Tags evolve like any other trait (or gene) Agents may discriminate based on tags John Holland (1992) => tags powerful “symmetry breaking” function in “social-like” processes In GA-type interpretation, tags = parts of the genotype reflected directly in the phenotype

Tag Models Tags may be bit strings signifying some observable cultural cues Tags may be a single real number Any distinguishing detectable cue Most show cooperation / altruism between selfish, greedy (boundedly rational) agents

Tags in the literature

Generic evolutionary algorithm Initialise all agents with randomly selected strategies LOOP some number of generations LOOP for each agent (a) in the population Select a game partner (b) from the population select a random partner with matching tag Agent (a) and (b) invoke their strategies receiving the appropriate payoff END LOOP Reproduce agents in proportion to their average payoff with some small probability of mutation (M) END LOOP

Agents – a tag and a PD strategy Tag = 5 Tag = 10 Cooperate Defect Tag = (say) Some Integer Game interaction between those with same tag (if possible)

How tags work Shared tags Mutation of tag Copy tag and strategy Game Interactions

Visualising the process Time Unique Tag Values Coop Defect Mixed Empty

Visualising the process Time Unique Tag Values Coop Defect Mixed Empty

Change your tags fast… Groups have to be formed more quickly than they invaded and killed New groups are formed by mutation on the tag Old groups are killed by mutation on the strategy So if tag mutation > strategy mutation this should promote cooperation? Test it by looking at the existing models and implementing a new one

Tag / strategy mutation rate

Network rewiring movie

Summary Simple copying heuristics based on individual utility with social structure => “as if” a motivating force higher than self-interest towards to in-group Agents “vote with their feet” by moving to better groups via copying History of system important to understand behaviour at any given point in time

Any Use? Can such processes be observed in real systems? How could they be measured? Models assume the rapid ability to create new groups and free movement between groups – is this valid in real systems? Online communities? Ephemeral groups? Twitter tags? Can such models be adapted from the abstract to particular scenarios? Vary assumptions?