Achieving Cooperative Social Behavior Through The Use Of Tags Critical MAS 2004Aviv Zohar.

Slides:



Advertisements
Similar presentations
Reinforcement Learning
Advertisements

Tutorial 1 Ata Kaban School of Computer Science University of Birmingham.
Ultimatum Game Two players bargain (anonymously) to divide a fixed amount between them. P1 (proposer) offers a division of the “pie” P2 (responder) decides.
Evolution and Repeated Games D. Fudenberg (Harvard) E. Maskin (IAS, Princeton)
Evolution of Cooperation The importance of being suspicious.
1 Evolution & Economics No Evolutionary Stability in Repeated Games Played by Finite Automata K. Binmore & L. Samuelson J.E.T Automata.
Infinitely Repeated Games. In an infinitely repeated game, the application of subgame perfection is different - after any possible history, the continuation.
6-1 LECTURE 6: MULTIAGENT INTERACTIONS An Introduction to MultiAgent Systems
An Introduction to... Evolutionary Game Theory
Maynard Smith Revisited: Spatial Mobility and Limited Resources Shaping Population Dynamics and Evolutionary Stable Strategies Pedro Ribeiro de Andrade.
Cooperation in Anonymous Dynamic Social Networks Brendan Lucier University of Toronto Brian Rogers Northwestern University Nicole Immorlica Northwestern.
On Quantum Walks and Iterated Quantum Games G. Abal, R. Donangelo, H. Fort Universidad de la República, Montevideo, Uruguay UFRJ, RJ, Brazil.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
EC – Tutorial / Case study Iterated Prisoner's Dilemma Ata Kaban University of Birmingham.
Satisfaction Equilibrium Stéphane Ross. Canadian AI / 21 Problem In real life multiagent systems :  Agents generally do not know the preferences.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
1 Economics & Evolution Number 2. 2 Reading List.
Tags and Image Scoring for Robust Cooperation By Nathan Griffiths Presented at AAMAS 2008.
A Memetic Framework for Describing and Simulating Spatial Prisoner’s Dilemma with Coalition Formation Sneak Review by Udara Weerakoon.
The Evolution of Cooperation Shade Shutters School of Life Sciences & Center for Environmental Studies.
Applications of Evolutionary Computation in the Analysis of Factors Influencing the Evolution of Human Language Alex Decker.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
Human Social Dilemmas Cooperation Between Non-Relatives Complex Evolutionary Problem Repeated Interaction, Conditional Cooperation Human Cooperation Often.
Cooperation and ESSs Putting Humpty together again.
Simulating the Evolution of Contest Escalation Winfried Just and Xiaolu Sun Department of Mathematics and Edison Biotechnology Institute Ohio University.
PRISONER’S DILEMMA By Ajul Shah, Hiten Morar, Pooja Hindocha, Amish Parekh & Daniel Castellino.
On Bounded Rationality and Computational Complexity Christos Papadimitriou and Mihallis Yannakakis.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
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
Schuster et al., J Biol Phys 34:1–17 (2008) Hadas Zur Computational Game Theory Project 2012.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Example Department of Computer Science University of Bologna Italy ( Decentralised, Evolving, Large-scale Information Systems (DELIS)
Rationality meets the tribe: Some models of cultural group selection David Hales, The Open University Hales, D., (2010) Rationality.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
SLAC and SLACER: Simple copy & rewire algorithms for trust and cooperation in P2P David Hales, Stefano Arteconi, Ozalp Babaoglu University of Bologna,
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
Can Tags Build Working Systems? From MABS to ESOA Attempting to apply results gained from Multi-Agent- Based Social Simulation (MABSS)
Finite Iterated Prisoner’s Dilemma Revisited: Belief Change and End Game Effect Jiawei Li (Michael) & Graham Kendall University of Nottingham.
Multi-Patch Cooperative Specialists With Tags Can Resist Strong Cheaters, Bruce Edmonds, Feb 2013, ECMS 2013, Aalesund, Norway, slide 1 Multi-Patch Cooperative.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
Putting “tags” to work Attempting to apply results gained from agent- based social simulation (ABSS) to MAS. Dr David Hales
Evolution Programs (insert catchy subtitle here).
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.
Section 2 – Ec1818 Jeremy Barofsky
Project funded by the Future and Emerging Technologies arm of the IST Programme From Selfish Nodes to Cooperative Networks – Emergent Link-based Incentives.
The Evolution of Specialisation in Groups – Tags (again!) David Hales Centre for Policy Modelling, Manchester Metropolitan University, UK.
Stabilization of Tag-Mediated Interaction by Sexual Reproduction in an Evolutionary Agent System F. Alkemade D.D.B. van Braget J.A. La Poutr é Copyright.
Game Theory by James Crissey Luis Mendez James Reid.
Iterated Prisoner’s Dilemma Game in Evolutionary Computation Seung-Ryong Yang.
The evolution of cooperation. Altruism and the selfish gene n Altruism: benefit b to recipient at cost -c to the donor.
Project funded by the Future and Emerging Technologies arm of the IST Programme Altruism “for free” using Tags David Hales Department.
Replicator Dynamics. Nash makes sense (arguably) if… -Uber-rational -Calculating.
Evolving Strategies for the Prisoner’s Dilemma Jennifer Golbeck University of Maryland, College Park Department of Computer Science July 23, 2002.
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.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
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.
Indirect Reciprocity in the Selective Play Environment Nobuyuki Takahashi and Rie Mashima Department of Behavioral Science Hokkaido University 08/07/2003.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Simulating Evolution Robbie Rosati
Game Theory and Cooperation
Towards Realistic Models for Evolution of Cooperation
Altruism “for free” using Tags
Boltzmann Machine (BM) (§6.4)
Evolving cooperation in one-time interactions with strangers
Phase transitions to cooperation in the prisoner‘s dilemma
Presentation transcript:

Achieving Cooperative Social Behavior Through The Use Of Tags Critical MAS 2004Aviv Zohar

The Prisoner’s Dilemma DC TSTS RRRR C PPPP STST D T>R>P>ST>R>P>S 2R>S+T2R>S+T A symmetric 2 player matrix game with 2 strategies: Cooperate,Defect And 4 Possible payments nicknamed: Temptation, Reward, Penalty,Sucker

The Shadow of the Future – Cooperation Through Repeated Play Axelrod showed that if players play multiple rounds of the dilemma, cooperation can be sensible. Cooperating with someone can encourage cooperation in the future. Reciprocating agents (Tit for Tat strategy) faired very well against a wide range of strategies. Axelrod placed various strategies in an evolutionary setting and checked which strategy would survive and dominate.

Evolutionarily Stable Strategies (ESS) Very similar to Nash equilibriums. These are strategies that are stable in an evolutionary setting: A strategy is evolutionarily stable if in a population where almost all players follow it, it gets the highest payoff compared to other strategies. Tit for Tat is almost Evolutionarily stable. But so is the strategy of permanent defection. (ALL-D) If the population is composed entirely of ALL-D players, Tit for Tat cannot invade!

Niches and Invasion Axelrod pointed out that if the invading group only interacts with itself, it may grow and replace the previous ESS. Niches are another idea adopted from biology: If we keep populations separate they will each evolve differently – And find different solutions for survival. In our case – they may reach different equilibrium points. Biological niches are often imposed by geographical separation. (for example: species evolving differently on different continents)

Tags Our agents will be identified only according to a number or a string of bits called a tag. Tags are visible to everyone. Agents will be directed to interact with others similar to them. This is another way to impose a topology on the system – Agents with similar tags are considered “closer” to each other. We have another way to create niches. Another way of looking at tags is from the Social perspective: These are markers that humans/animals observe in each other that may influence their opinions.

Tags in the Human World They are all around us: Some are social markers –Gang Colors –Secret Handshakes –Native tongue and accent –Chinese associations Some are determined genetically –Hair color –Skin Color

Rick Riolo’s experiments with tags Each agent uses tags to select acceptable partners for a game of iterated prisoner’s dilemma (IPD). Tags are from the range [0,1] Each agent also has a tag bias (tolerance) b  (0,100] Agent i will agree to play with agent j with probability: The game starts only if both agree to play. Players are given several chances to reject partners with a cost for each rejection.

Rick Riolo’s experiments with tags (Cont.) The strategies allowed are very simple. Players only remember the last game step. Only 3 genes from the range [0,1] determine them: (i,p,q) i - the probability of cooperating on the first round. p - the probability of cooperating after the opponent cooperated. q - the probability of cooperating after the opponent defected. Riolo chose the parameters R=T=5, S=P=1. This is not exactly the PD matrix we are used to. Each player’s strategy independently determines the other player’s reward This is only a dilemma in an evolutionary context.

From “The Effects and Evolution of Tag-Mediated Selection of Partners in Populations Playing the Iterated Prisoner’s Dilemma” - Rick Riolo Riolo’s Results

Riolo’s Results (Cont.) Populations with tags achieve more cooperation faster. A fixed tag bias got the population a higher average fitness than an evolved bias. This became more distinct as the search cost was increased. When there’s a high cost on searching – it is better to be less picky. Populations did not always evolve tag use (when started with High bias) – especially when search cost was high.

Evolving Social Rationality for MAS using Tags - Hales & Edmonds Demonstrate application of tags on various models. each one with it’s own lessons. Cooperation can be achieved even without iterated play, and without any memory. In some systems a negative scaling cost is found: The larger the group is, the faster it converges to cooperation!

Hales & Edmonds – Model M1 A simple population of players without tags. Each player has a simple deterministic strategy - “C” or “D” which is encoded in it’s genes. Random encounters between players that play a single round of the Prisoner’s dilemma. As expected: The population quickly converges to defecting players.

Hales & Edmonds – Model M2 Tags are added to the M1 model. These are strings of 32 bits. Tags are inherited from the parents along with the Strategy. There is also a small chance of mutation. Agents look for similar partners to play with. If none are found they play a random opponent. Agents are not forced to cooperate with identical partners. The results: Over 90% of the players at any given time cooperate!

Model M2 – a Dynamic Equilibrium Each unique tag defines a group of players that only play internally. If a group contains even a single defecting player, It will Quickly reproduce and eliminate all cooperating players in the group. The group is thus quickly reduced to a group of defecting players. However, if other groups exist that are without defectors, they do much better. Group selection! So cooperation is very unstable – but we still find lots of it!

Hales & Edmonds – Model M3 An attempt to see if cooperation between non identical agents could emerge. Each agent is given: A tag from the range [0,1] A tolerance level from the range [0,1] And a “skill” from {1,2,3,4,5} which represents the ability to consume resources of types {1,2,3,4,5}. Agent i will agree to interact with agent j only if:

Model M3 (Cont.) At every round agents are awarded several resources. If they posses the appropriate skill, they can consume them and gain 1 utility. Otherwise, they can choose to either –donate them to other agents with a similar tag at a cost to themselves, or – discard the resource. Now every “group” will need to be composed of agents with complementing skills.

Model M3 - Results From “Evolving Social Rationality for MAS using Tags” – David Hales & Bruce Edmonds.

Hales & Edmonds – Model M4 Attempting to apply tags to a more realistic task domain: Robots are tasked with unloading incoming trucks. There are 10 unloading bays And 5 Robots per bay. Each can unload 5 units per cycle. Each robot gets rewarded only for the amount unloaded in it’s own bay. If a bay is empty, a truck carrying ‘s’ units will arrive with probability ‘p’, and will stay at the bay until it is empty. Robots can request help from others.

Model M4 (Cont.) The tag model: Each robot is given an integer tag from Robots that have a truck in their bay request help from robots with identical tags (or random ones if there are none) Robots agree to help according to their genes and whether or not there is a truck in their own bay.

Model M4 - Results From “Evolving Social Rationality for MAS using Tags” – David Hales & Bruce Edmonds.

The Benefits of Tags that We’ve Seen: A high degree of cooperation. Extremely simple solutions. Cheap to implement. Robust. Noise is actually built in to the system. No complex reasoning was used. Local interactions. No global view needed. Sometimes we get a negative scaling cost.

Limitations of Tags Can they be applied outside the evolutionary setting? (some other kind of reasoning?) Behavior and tag need to be somehow correlated. We cannot allow totally free change of tags. Interactions are only with similar agents. What if we want more? (Interactions between all members of the population)

A qualitative analysis of a tag based system The evolving population can be seen as a dynamic system. This is a view that is often used in population biology. Differential equations can approximate the interaction between the various groups. Fixed points, Attractors and bifurcations can point to interesting properties of the system.

A minimal model for tag based cooperation – Traulsen & Schuster A simplified analysis of a donations model by Riolo. The idea is to show why the tolerance level oscillates. Only 2 tags are allowed “red” and “blue”. Players can donate some goods at a cost to themselves, but at greater benefit to the recipient. Only 2 behaviors are allowed: Players can either donate to players with the same tag only, or donate to everyone. There are thus only 4 types of players possible: SelfishTolerant p3p1Red p4p2Blue

The Replicator Equation A simple dynamic equation that embodies the idea that individuals with above average fitness reproduce and replace individuals with low fitness.

The System Dynamics - No Drift The mean payoff a player can expect is set as the fitness. The system’s behavior can now be determined. From “A Minimal Model for Tag-Based Cooperation” – Arne Traulsen & Heinz Georg Schuster.

Adding a Slow Drift Towards Tolerance From “A Minimal Model for Tag-Based Cooperation” – Arne Traulsen & Heinz Georg Schuster. A small biased drift towards tolerance is added to the equations. This Drift was also found in the experimental models. The system behavior changes dramatically.

References Axelrod. The Evolution of Cooperation (Basic Books, New York, 1984). Hales & Edmonds. Evolving Social Rationality for MAS using “Tags”. In Rosenschein, J. S., et al. (eds.) Proceedings of the 2nd International Conference on Autonomous Agents and Multiagent Systems, (ACM Press, 2003) Hofbauer & Sigmund. Evolutionary Games and Population Dynamics (Cambridge Univ. Press, Cambridge, 1998). Maynard-Smith. Did Darwin Get it Right? Essays on Games Sex and Evolution (Penguin Books Ltd. New York 1993). Riolo, Cohen & Axelrod. Cooperation without Reciprocity. Nature 414, (2001). Riolo. The Effects and Evolution of Tag-Mediated Selection of Partners in Populations Playing the Iterated Prisoner’s Dilemma. In Proceedings of the Seventh International Conference on Genetic Algorithms, (Kaufmann Publishers Inc. 1997). Sigmund & Nowak. Tides of tolerance. Nature 414, (2001). Traulsen & Schuster, A Minimal Model for Tag-Based Cooperation. Phys. Rev. E. 68, (2003)