CITS4403 Computational Modelling Agent Based Models.

Slides:



Advertisements
Similar presentations
New Mexico Computer Science for All
Advertisements

Beyond the Centralized Mindset
Intelligent Agents Russell and Norvig: 2
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 7 McGraw-Hill/IrwinCopyright © 2010 The McGraw-Hill Companies, Inc. All rights reserved.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Prisoner's dilemma Two suspects A, B are arrested by the police.Two suspects A, B are arrested by the police. The police have insufficient evidence for.
Stephen McCray and David Courard-Hauri, Environmental Science and Policy Program, Drake University Introduction References 1.Doran, P. T. & Zimmerman,
Evolving Flocking Simulation and Robotics Dan Sayers iotic.com.
Flocks, Herds, and Schools: A Distributed Behavioral Model By: Craig Reynolds Presented by: Stephanie Grosvenor.
Behavioral Animation Procedural Animation Type?. Behavioral Animation Introduced by C. Reynolds (1987) Animating many things at one time –A group of the.
Swarm algorithms COMP308. Swarming – The Definition aggregation of similar animals, generally cruising in the same direction Termites swarm to build colonies.
Chris Snijders – Complexiteit: Schelling/Ising A social science variation: Schelling’s segregation models
Fundamentals of Political Science Dr. Sujian Guo Professor of Political Science San Francisco State Unversity
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
The Demand for Public Goods Frederick University 2014.
A Memetic Framework for Describing and Simulating Spatial Prisoner’s Dilemma with Coalition Formation Sneak Review by Udara Weerakoon.
Agent-Based Modelling Piper Jackson PhD Candidate Software Technology Lab School of Computing Science Simon Fraser University.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
Agent Based Modeling (ABM)
Agent-Based Acceptability-Oriented Computing International Symposium on Software Reliability Engineering Fast Abstract by Shana Hyvat.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
Anonymizing Web Services Through a Club Mechanism With Economic Incentives Mamata Jenamani Leszek Lilien Bharat Bhargava Department of Computer Sciences.
Nino Boccara Highway Car Traffic as a Complex System The Physicist’s Point of view.
Agent Based Modeling and Simulation
Dynamic Models of Segregation
Biology: flocking, herding & schooling Day 5 COLQ 201 Multiagent modeling Harry Howard Tulane University.
A Game-Theoretic Approach to Strategic Behavior. Chapter Outline ©2015 McGraw-Hill Education. All Rights Reserved. 2 The Prisoner’s Dilemma: An Introduction.
Week 3a Mechanisms for Adaptation. POLS-GEOG-SOC 495 Spring Lecture Overview Review –CAS –Principles of chaos How do systems “learn”? –“Credit.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
(Particle Swarm Optimisation)
Multi-Agent Modeling of Societal Development and Cultural Evolution Yidan Chen, 2006 Computer Systems Research Lab.
Emily Wilkins and David Courard-Hauri, Environmental Science and Policy Program, Drake University Introduction References 1.Doran, P. T. & Zimmerman, M.
Finite Iterated Prisoner’s Dilemma Revisited: Belief Change and End Game Effect Jiawei Li (Michael) & Graham Kendall University of Nottingham.
Chapter 12 - Imperfect Competition: A Game-Theoretic Approach Copyright © 2015 The McGraw-Hill Companies, Inc. All rights reserved.
Game Theory & the cuban missile crisis
Cellular Automata Spatio-Temporal Information for Society Münster, 2014.
Exploring Complex Systems through Games and Computer Models Santa Fe Institute – Project GUTS
TA Office Hours Tue: 10am – 11am, TBA. Walk through previous lecture.
Agent Based Modeling (ABM) in Complex Systems George Kampis ETSU, 2007 Spring Semester.
Evolving cooperation in one-time interactions with strangers Tags produce cooperation in the single round prisoner’s dilemma and it’s.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
1 Real-Time Parking Information on Parking-Related Travel Cost TRIP Internship Presentation 2014 Kory Harb July 24, 2014 Advisor: Dr. Yafeng Yin Coordinator:
Distributed Models for Decision Support Jose Cuena & Sascha Ossowski Pesented by: Gal Moshitch & Rica Gonen.
Cellular Automata Introduction  Cellular Automata originally devised in the late 1940s by Stan Ulam (a mathematician) and John von Neumann.  Originally.
REFERENCES: FLOCKING.
How to Analyse Social Network? : Part 2 Game Theory Thank you for all referred contexts and figures.
UUCF Summer RE 2011 Brain Glitches Session 4: Prisoner’s Dilemma.
Competition Unit Competition & Ethics. Unit Plan Assignment – Marketing. COMPETITION. Lesson 3 Lesson 3 : Competition and Ethics NOTES Handout The Prisoners.
1 Social Dilemmas. 2 The Anatomy of Cooperation How does cooperation develop and how is it sustained in an environment where individuals are rewarded.
Evolving Strategies for the Prisoner’s Dilemma Jennifer Golbeck University of Maryland, College Park Department of Computer Science July 23, 2002.
CS320n –Visual Programming Execution Control with If / Else and Boolean Functions (Slides 6-2-1) Thanks to Wanda Dann, Steve Cooper, and Susan Rodger for.
Evolution of Cooperation in Mobile Ad Hoc Networks Jeff Hudack (working with some Italian guy)
The Prisoner’s Dilemma or Life With My Brother and Sister John CT.
Taylor. Na, Amy. Hong, Brian. Sang, Luck Yoon. What is the Game Theory? intelligent rational decision-makers Game theory is "the study of mathematical.
Advanced Subjects in GT Outline of the tutorials Static Games of Complete Information Introduction to games Normal-form (strategic-form) representation.
Spatio-Temporal Information for Society Münster, 2014
International Interdisciplinary Seminar
Law, Economics and the Prisoners’ Dilemma
PRISONER’S DILEMMA BERK EROL
Chapter 12 - Imperfect Competition: A Game-Theoretic Approach
tit-for-tat algorithm
Prisoner’s Dilemma.
CASE − Cognitive Agents for Social Environments
Two suspects are arrested by the police Two suspects are arrested by the police. The police have insufficient evidence for a conviction,
R. W. Eberth Sanderling Research, Inc. 01 May 2007
Agent Based Modeling (ABM)
Prisoner’s Dilemma (aka Reds & Blues)
Introduction to RePast and Tutorial I
Presentation transcript:

CITS4403 Computational Modelling Agent Based Models

Agents Agents represent entities in a system which are able to perform actions, and respond to local information according to a set of rules. Intelligent software agents are often designed around the Belief- Desire-Intention model. Multi-agent systems are able to achieve complex goals using relatively simple agents. Agent based models are an easy way to model the effects of basic assumptions.

Segregation The Schelling model of the world is a grid; each cell represents a house. The houses are occupied by two kinds of “agents,” labeled red and blue, in roughly equal numbers. At any point in time, an agent might be happy or unhappy, depending on the other agents in the neighborhood. The neighborhood of each house is the set of eight adjacent cells, and agents are unhappy if they have less than 2 neighbours like themselves. If they’re unhappy, they move to an arbitrary empty cell.

Emergent behaviour From very simple rules we notice segregation as an emergent property. Note agents are not opposed to the other type, they are just seeking familiarity. What is a good measure of segregation?

Agent-Based Programming Agent Oriented Programming is an programming paradigm that uses software agents working towards local goals to achieve global results. Netlogo ( is a good example of an agent oriented language, which has an excellent model library:

Agent-based models The characteristics of agent-based models include: Agents that model intelligent behavior, usually with a simple set of rules. The agents are usually situated in space (or in a network), and interact with each other locally. They usually have imperfect, local information. Often there is variability between agents. Often there are random elements, either among the agents or in the world.

Traffic Jams Traffic models are a classic example of agent based modelling. The Highway is a one-lane road that forms a circle, but it is displayed as a series of rows that spiral down the canvas. Each driver starts with a random position and speed. At each time step, each Driver accelerates or brakes based on the distance between it and the Driver in front.

Boids Agents in this models are called “boids”. Each agent simulates three behaviors: Collision avoidance: avoid obstacles, including other birds. Flock centering: move toward the center of the flock. Velocity matching: align velocity with neighboring birds. Boids make decisions based on local information only; each boid only sees (or pays attention to) other boids in its field of vision and range.

Prisoner’s Dilema Two suspects [Alice and Bob] are arrested by the police. The police have insufficient evidence for a conviction, and, having separated the prisoners, visit each of them to offer the same deal. If one testifies against the other (defects) and the other remains silent (cooperates), the defector goes free and the silent accomplice receives the full one-year sentence. If both remain silent, both prisoners are sentenced to only one month in jail for a minor charge. If each betrays the other, each receives a three- month sentence.

Iterated Prisoners Dilema What is the best strategy is the prisoners dilema? What if you had to repeatedly play the prisoner’s dilema with the same person, or with the same population? In the late 1970s Robert Axelrod organized a tournament to compare strategies. Participants to submitted strategies, then played the programs against each other and kept score.

Emergence An emergent propertyis a characteristic of a system that results from the interaction of its components, not from their properties. Conventional science is based on the axiom that if you know the rules that govern a system, you can predict its behavior. However some systems are computationally irreducible: the only way to predict their properties is to execute the system. To some people, “emergence” is another name for ignorance: a property is emergent if we don’t have a reductionist explanation for it.

Emergent Properties Many complex systems have properties, as a whole, that their components do not: The Rule 30 cellular automaton is deterministic, and the rules that govern its evolution are completely known. Nevertheless, it generates a sequence that is statistically random. The agents in Schelling’s model are not racist, but the outcome of their interactions is as if they were. Traffic jams move backward even though the cars in them are moving forward. The behavior of flocks and herds emerges from local interactions between their members. As Axelrod says about the iterated prisoner’s dilemma: “The emergence of cooperation can be explained as a consequence of individual[s] pursuing their own interests.”

Free Will William James proposed a two-stage model in which possible actions are generated by a random process and then selected by a deterministic process David Hume suggested that our perception of making choices is an illusion; in that case, our actions are deterministic because the system that produces them is deterministic. Roger Penrose proposes that free will could be a consequence of quantum uncertainty. Free will is the ability to make choices, but if our bodies and brains are governed by deterministic physical laws, our actions would be determined. Some arguments are: