MIS 585 Special Topics in IMS Agent-Based Modeling Bertan Badur Department of Management Information Systems Boğaziçi University.

Slides:



Advertisements
Similar presentations
Got Gas? Jim and Michael. Problem Statement (Weight 15%) An investigation of a gas pump queue as a function of rationing policy We modeled the queue at.
Advertisements

Netlogo! NetLogo is a programmable modeling environment for simulating complex systems. Modelers can give instructions to hundreds or thousands of independent.
Agents and Pervasive Computing Group Università di Modena e Reggio Emilia System Requirements NetLogo is designed: to run almost any type of computer.
13 giugno 2006Master in economia e politica sanitaria - Simulazione per la sanità 1 _Strumenti, seguito _______________________________________ Un modello.
New Mexico User Test Starlogo TNG September 16, 2006 Starlogo TNG September 16, 2006.
Netlogo and its Relatives Logo (Papert) –Language for teaching mathematics graphically –Tell turtle how to move Starlogo (Resnick) & StarlogoT (Wilensky)
StarLogoTNG 101 Treasure Hunt Game Unit Lesson 9: Variables.
Wurzer, Lorenz, Popov: „NetLogo Workshop (Part 1)“, in eCAADe 2012 Prague, Slide 1 „Netlogo First Steps (Artif. Societies) “, in Social Simulation Conference.
Day 1 Goal: To create a model of people hunting in the forest for mushrooms and then start working on improving their mushroom hunting ability mathematically.
Game of Life Rules and Games Linh Tran ECE 573. What is Life? Life is just one example of a cellular automaton, which is any system in which rules are.
CITS4403 Computational Modelling Game of Life. One of the first cellular automata to be studied, and probably the most popular of all time, is a 2-D CA.
1 The Game of Life Supplement 2. 2 Background The Game of Life was devised by the British mathematician John Horton Conway in More sophisticated.
EPIDEMIOLOGY: Introduction to the Agent-based epidemic modeling Dr. Qi Mi Department of Sports Medicine and Nutrition, SHRS, Univ. of Pitt.
Mrs. Chapman. Tabs (Block Categories) Commands Available to use Script Area where you type your code Sprite Stage All sprites in this project.
CELLULAR AUTOMATON Presented by Rajini Singh.
1 An introduction to programming concepts with Scratch.
2-Day Introduction to Agent-Based Modelling Day 2: Session 5 Variables and Debugging.
Mr. Wortzman. Tabs (Block Categories) Available Blocks Script Area Sprite Stage All sprites in this project.
StarLogoTNG Treasure Hunt Game Unit Lesson 1: Basic Movement.
Teaching Contemporary Mathematics Conference January 25, 2013 Christine Belledin NC School of Science and Mathematics.
Department of Computer Science What is NetLogo UH-DMML  Multi-agent programmable modeling environment  Well suited for modeling complex systems evolving.
An Introduction to NetLogo given by Gabriel Wurzer. ,
Modeling and Simulation Module 1: Lesson 1
Agent-Based Modeling and Simulation (ABMS) Bertan Badur Department of Management Information Systems Boğaziçi University.
ABM Frameworks Dr Andy Evans With additions from Dr Nick Malleson.
2-Day Introduction to Agent-Based Modelling Day 1: Session 4 Networks.
Agent-Based Modeling and Simulation (ABMS) Bertan Badur Department of Management Information Systems Boğaziçi University.
CISC 1600 – Lecture 3.2 Simulations Complex Input & Output NetLogo.
2-Day Introduction to Agent-Based Modelling Day 2: Session 8 Exploring Model Collections, NetLogo Lists, Further Resources.
Agent-Based Modeling and Simulation (ABMS) Bertan Badur Department of Management Information Systems Boğaziçi University.
Week 11 DO NOW QUESTIONS. An ask turtles block is a set of instructions that is issued to every turtle. Even though computers can do things very quickly,
Programming with Alice Computing Institute for K-12 Teachers Summer 2011 Workshop.
B.A. (Mahayana Studies) Introduction to Computer Science November March Logo (Part 2) More complex procedures using parameters,
1 Data Structures CSCI 132, Spring 2014 Lecture 3 Programming Principles and Life Read Ch. 1.
An Introduction to NetLogo Gabriel Wurzer, Vienna University of Technology AnthropologischeGesellschaftWien.
Introduction to Algorithms using Netlogo. What’s an Algorithm Definitions of Algorithm on the Web: –A procedure or formula for solving a problem.
Week 9 DO NOW QUESTIONS. Question: If the following procedure is executed after 1 turtle is created in the program, what shape is created on the NetLogo.
Models in NetLogo Day 3 COLQ 201 Multiagent modeling Harry Howard Tulane University.
The Game of Life A simulation of "life". From simple rules, complex behavior arises Rules –A cell that is alive and has fewer than two live neighbors dies.
Playing God: The Engineering of Functional Designs in the Game of Life Liban Mohamed Computer Systems Research Lab
CELLULAR AUTOMATA A Presentation By CSC. OUTLINE History One Dimension CA Two Dimension CA Totalistic CA & Conway’s Game of Life Classification of CA.
Review Recursion Call Stack. Two-dimensional Arrays Visualized as a grid int[][] grays = {{0, 20, 40}, {60, 80, 100}, {120, 140, 160}, {180, 200, 220}};
Agent-Based Modeling and Simulation (ABMS) Bertan Badur Department of Management Information Systems Boğaziçi University.
2-Day Introduction to Agent-Based Modelling Day 2: Session 6 Mutual adaption.
Agent-Based Modeling and Simulation (ABMS) Bertan Badur Department of Management Information Systems Boğaziçi University.
StarLogoTNG Treasure Hunt Game Unit Lesson 1: Basic Movement.
Probability with Dice and Data, Wiggle Walk, and Colliding Turtles Modeling and Simulation Module 1: Lesson 1.
New Mexico Computer Science For All Variables and Scope Maureen Psaila-Dombrowski.
Agent-Based Modeling and Simulation (ABMS) Bertan Badur Department of Management Information Systems Boğaziçi University.
The Northern Lights: Demonstrations. Programmability Overview A major aspect of our project is programmability- it is an interactive display medium, the.
Cellular Automata FRES 1010 Eileen Kraemer Fall 2005.
Summer Computing Workshop. Session 3 Conditional Branching  Conditional branching is used to alter the normal flow of execution depending on the value.
 In computer programming, a loop is a sequence of instruction s that is continually repeated until a certain condition is reached.  PHP Loops :  In.
MIS 585 Special Topics in MIS: Agent-Based Modeling 2015/2016 Fall.
Conway’s Game of Life Jess Barak Game Theory. History Invented by John Conway in 1970 Wanted to simplify problem from 1940s presented by John von Neumann.
Copyright (c) 2003 by Prentice Hall Provided By: Qasim Al-ajmi Chapter 2 Introduction to Visual Basic Programming Visual Basic.NET.
M10 WS11:Krankenhausbedarfsplanung The World as We See It given by Gabriel Wurzer and Wolfgang E. Lorenz
1 Agent-Based Tools: focus on NetLogo Ing. Cristina Ponsiglione University of Naples Federico II Laboratorio di Simulazione ad Agenti.
An Introduction to NetLogo given by Gabriel Wurzer and Wolfgang E
Spatio-Temporal Information for Society Münster, 2014
Management Information Systems
Creating Simple Agent-Based Models
Management Information Systems
An introduction to Netlogo agent-based software
MIS 643 Agent-Based Modeling and Simulation 2016/2017 Fall.
Learning to program with Logo
Introduction to Grasshopper for rhino
Using Logo and Logic This presentation uses a version of Logo called StarLogo available through MIT. It can be downloaded for free and installed on your.
creating a ecosystems model in net logo
Presentation transcript:

MIS 585 Special Topics in IMS Agent-Based Modeling Bertan Badur Department of Management Information Systems Boğaziçi University

Outline Intorduction Life Heroes and Cowards Simple Economy

Introduction Intorduction to Agent-Based Modeling By U. Wilensky, W. Rand. IABM-WR Chapter 2

Introduction learn to construct simple ABMs “toy models” – not mean models of real phenomena thought experiments objects to think with simple to construct but exebits interesting, suprising emergent behavior

Outline Intorduction Life Heroes and Cowards Simple Economy

Life In 1970 British mathematician John Horton Conway, Conway (1976) cellular automata - the “Game of Life” Martin Gardner, Scientific American colomn

The Game Played on checkeboard – graph paper N x N cells – can be –“alive” or “dead”: state of a cell surrounded by –eight neighbour cells the grid is “wrap around” clock ticks – generation

Rules of the Game Each cell checks its own state and states of its neighbors and set itself as “alive” or ”dead” –if the cell has less then 2 alve neighbors – it dies –if it has more then 3 alive neighbors – it also dies –if it has 2 alive neighbors – it remains in its current state –if it has 3 alive neighors – if dead become alive, if alive, stay alive

NetLogo NetLogo has three tabs Interface tab –black area – “view” –white area – interface set user interface elements; buttoms, siliders.. observe results: output, plots.... Code tab Info tab

The view composed of grid of cells – patches how to open –click settings in toolbar or –on the visw double click and select edit Parameters to set –Location of orgin –max-pxcor, max-pycor 25 –patch size: 13 to 8 –world wraps hirizonallyi vertically, see IABM-WR pp 55 Box 2.1 Wrapping

NetLogo Code modules – procedures begin with to end with end usually setup –initializations go –processes taking place advences clock by tick

procedures – commands to proc name commands end Create a button executing procedure setup Create a button executing procedure go –forever is cheked – forever button write setup procedure code tab

to setup end to go end

Initialization to setup ;; ] end ask primitive asks selected agents to do actions by commands in brackets set color of all pathces to red set - primitive is assignment pcolor – variable for patches

Initialization to setup ;;clear all setings ;; set dead patches to blue ;; 10% of patches are alive ;; initilize clock end

to setup clear-all ask patches [ set pcolor blue if random 100 < 10 [ set pcolor green ] ] reset-ticks end

Exercise What is the difference between asking exactly 10% of the patches being alive –How do you perform this in general for any number of patches, exactly X% being alive the chance of a randomly seleced patch being alive is 10%

Box 2.2: Agent Centeric Thinking

ask patches [ if random 100 < 10 [set pcolor green] ;; end if ] ;; end ask or ask patches with [random 100 < 10] [ set pcolor green ] ] ;; end ask

Asking exactly 10% of patches to setup ask n-of 0.1*(51*51) patches [ set pcolor green ] ] ;; end ask ] ;;end setup or more generally to setup let number-of-patches count patches ask n-of 0.1*number-of-patches patches [ set pcolor green ] ] ;; end ask ] ;;end setup

go Procedure to go ;; each patch counts its alive neighbors ;; number of green neighboring patches ;; patches with 3 green naigbors turn or stay green ;; patches with 0 or 1 green neighbors turn or stay blue ;; patches with 4 or higher neighbors turn to blue end

go Implementation to go ask patches [ set live-neighbors count neighbors with [pcolor = green] ] ask patches [ if live-neighbors = 3 [set pcolor green] if live-neighbors = 1 or live- neighbors = 0 [set pcolor blue] if live-neighbors >= 4 [set pcolor blue] ]

to setup ask n-of 4 patches [ ask n-of 20 patches in-radius 5 [ set pcolor red ] end 4 patches are randomly selected for each randomly selected pathc for all patches in radius 5 select 20 randomly set their color to red

clear-all to setup clear-all ;abriviares as – ca - ask n-of 4 patches [ ask n-of 20 patches in- radius 5 [ set pcolor red ] end clear-all: clear all default values

using parameters globals [ num-clusters ] to setup clear-all set num-clusters 4 ask n-of num-clusters patches [ ask n-of 20 patches in-radius 5 [ set pcolor red ] end

creating 2 hunters - turtles create-tutrles 2 ;crt 2 [ set sıze 2 set color yellow ] create 2 turtles crt or create-tutles bnild-in turtle variables size and color

variable for patches patches-own [ live-neighbors ] live-neighbors variable

go procedure to go ask turtles [search] end to search ifelse tıme-sınce-last-found <= 20 [right (random 181) - 90] [right (random 21) - 10] forward 1 end cifelse boolean condition [ block whan true ] [ block when false ] right: turn right by angle in degrees

variable for turtles tutrles-own [ tıme-sınce-last-found ] tıme-sınce-last-found variable for all turtles time passed since last mushroom has found by the hunter

add to the search procedure ifelse pcolor = red [ set tıme-sınce-last-found 0 set pcolor yellow ] [ set tıme-sınce-last-found tıme-sınce- last-found + 1 ] end if found pcolor is red set tıme-sınce-last-found to 0 set pcolor yellow else increment tıme-sınce-last-found by one

command center select turtles write commands hatch 1 [right 160] show count turtles

firther modifications adding ticks add reset-ticks to the end of setup add tick to the begining of go following motion of hunters add pen-down to the setup procedute when initilizing turtles

Stable Patterns 1 – Still Lifes: stable shapes unless other shapes collide with them –block, the beehive, the loaf,... 2 – Oscillators: repeat over time 3 – Spaceships: move across the life world Unstable Patterns: guns: a pattern with a main part that repeats like an oscillator and periodically emits spaceships

In 1983, Stephan Wolfram – physisist and mathematical software entrepreneur One dimensional CA with only one neighbor in each side classified all possible rules into four behavioral regions –homogenous, periodic, chatoic and complex Complexity in nature – due to CA like simple mechanisms

Outline Intorduction Life Heroes and Cowards Simple Economy

Heroes and Cowards

Rules of the game with people each choose a heroe and an enemy two stages: first every one act – coward –move be sure that your friend is always between you and your enemy –hiding from your enemy behind your friend cowardly second – behave like a heroe –move between your friend and enemy –protecting your friend from your enemy – herotic manner

setup pseudocode to setup ;; clear all previous settings variables ;; make patches white ;; create a set of turtles reand tne number froma slider ;; set x y corrdinates randomly ;; set colors to blue for cowards and red for heroes ;; if mixed is choosen determine crowads and heroes randomly while settng their colors ;; set one other turtle as their friends and oneother turtle as their enemies ;; reset ticks end

setup code turtles-own [friend enemy] to setup ca ask patches [set pcolor white] crt number [ setxy random-xcor random-ycor if personalities = "cowardly" [set color red] if personalities = “breverly" [set color blue] if personalities = "mixed" [set color one-of [blue red]] set friend one-of other turtles set enemy one-of other turtles ] reset-ticks end

Interface elements slider: –variable: number –default 68 Chooser –variable: personalities –choices: “”” “cowardly”, “brawe”, ”mixed” Settings –wrap off

go pseudocode go at each tick if the agent is heroe act brawely – in a herotic manner if the agent is cowars act cowardly advance clock by one end

to go ask turtles [ if color = blue [act- bravely] if color = red [act- cowadly] ] tick end

acting submodels to act-bravely ;; move toward the mod of your friend and your enemy facexy ([xcor] of friend + [xcor] of enemy) / 2 ([ycor] of friend + [ycor] of enemy) / 2 fd 0.1 end to act-cowadly ;; set your friend between you and your enemy facexy [xcor] of friend + ([xcor] of friend - [xcor] of enemy) / 2 [ycor] of friend + ([ycor] of friend - [ycor] of enemy) / 2 fd 0.1 end

Random number generation sequance of random numbers initial value is taken from the clock of computer if you want to strart from the same seed random-seed 137 show random 100 always generate the same sequance of random numbers

Outline Intorduction Life Heroes and Cowards Simple Economy

Economies – heterogenous actors –buyers and sellers in 1996, J. Epstein, R. Axtell, SugerScape

Fixed number of people: 500 each starting out with inital amount of money: 100 At each tick, each person gives one of her 1 dollar‘s to any other person at random What will happen to the distribution of money? constraint – total amount of money fixed –no one can have negative money –if income is zore, connot give any away

is there a limiting distribution of money? Intiution: –flat – initially every body has the saime money randomly seleced one to give –normal -

Version 1 to setup ;; clear everything ;; create 500 turtles with an initial wealth of 100 each ;; reset tick end

setup turtles-own [wealth] to setup ca crt 500 [ set wealth 100 ] reset-ticks end

Version 1 to go ;;ask turles to transact if thye have positive or wealth ;; advence clock end to transact ;; contect turtle ;; decrement wealth of current turtle by one ;; for one of the other turtles, increment its wealth by one end

go and transact to go ask turtles with [wealth > 0] [transact] tick end to transact set wealth wealth - 1 ask one-of other turtles [set wealth wealth + 1] end

Exercises can you move the wealth chacking condition to transact? can you use with instead of if?

Monitoring by histogram Adjust settings world size –orgine: left button –max-xcor 500 –max-ycor 80 –patch size 1 –no wraping in both dimensions Interface – plot –max-x:500, max-y:40 –histrogram [wealth] of turtles –pen mode: bar –Color green

Using view with an histogram For turtles: –size:2 –color: green –shape: “circle” x coordinate of view – wealth y coordinate of view – randomly assigned kind of bar of a histogram During iterations set x coordinate to wealth if wealth is less then 500

Version 2 setup turtles-own [wealth] to setup ca crt 500 [ set size 2 set shape "circle" set color green set wealth 100 setxy wealth random-ycor ] reset-ticks end

go and transact to go ask turtles with [wealth > 0] [transact] ask turtles [ if wealth <= max-pxcor [set xcor wealth]] tick end to transact set wealth wealth - 1 ask one-of other turtles [set wealth wealth + 1] end