Run organizer2 in your browser
uses NetLogo 2.1
requires Java 5 or newer
(system requirements)

Download organizer2
If clicking does not initiate a download, try right clicking or control clicking and choosing "Save" or "Download".

Note: If you have trouble running the model in your browser, you may wish to download the application instead.

WHAT IS IT?

Title: Social dance in cyber space.
This program was develop by A.K. Dewdney's idea in Scientific American. Hew described a algorihtm about how the people can organize their space between them in a digital party. In behavioral science it is important point of proximity space of people. Some people have more or less tolerable space. How can we model this proximity index? We can use Dewdney algorihtm. Each people in digital party have a ideal distance again other people. Program calculates the concret distance between a given agent and other agents. If the summa of these distances are less as the former distance in former iteration than agent moves to the xy coordinate of this distance.

HOW IT WORKS

dis-*-* is the ideal distance between the given agents.
dist1-** distance between two agents
dist2-** is sqrt(dist1-**)
next computed total space is summa of absolute value of given dist2's.
If next distance is better than the former the agent will move to this coordinates.

HOW TO USE IT

You can modify the affection distance between agents in sliders.
-100 value represent agnet's hate again other agent.
100 value: agent has very love other agent.

EXTENDING THE MODEL

Let's try find some ideal distances.

CREDITS AND REFERENCES

Simulation was written by Kazmer Karadi, Institute of Behavioral Sciences, Faculty of Medicine, Univeristy of Pécs, Pécs, Szigeti u.12. H-7624, kazmerkaradi@hotmail.com

(back to the NetLogo User Community Models)