|
If you download the Fables IME, most of the models here in the Models Library are included already. Example Models are intended to be examples of how to model in the Fables programming language, and how to use its capabilities. How to install the downloaded models? Just unpack the downloaded archives into the sample directory of the Fables IME installation. The model is accessable through the Example Project Wizard afterwards. How to Contribute and/or share your models
We would be happy to include any Fables models in the Models Library, and we encourage users to share their models with the user community. Contributed models will be credited to their authors.
You may wish to
This e-mail address is being protected from spambots. You need JavaScript enabled to view it
your models for possible inclusion in the Models Library. We need a short description, a screenshot of the simulation, the Fables sources and chart XMLs.
|
|
Iterated Prisonner's Dilemma |
 |
 |
 |
The Model
The Prisoner's Dilemma (PD) was described by Merrill Flood and Melvin Dresher, and is closely related to game theory. This implementation of the model based on the NetLogo version, which may give a good opportunity to compare the languages.
In its classical form, the prisoner's Dilemma is presented as follows:Two suspects are arrested by the police. The police have insufficient evidence for a conviction, and, having separated both prisoners, visit each of them to offer the same deal. If one testifies (defects from the other) for the prosecution against the other and the other remains silent (cooperates with the other), the betrayer goes free and the silent accomplice receives the full 10-year sentence. If both remain silent, both prisoners are sentenced to only six months in jail for a minor charge. If each betrays the other, each receives a five-year sentence. Each prisoner must choose to betray the other or to remain silent. Each one is assured that the other would not know about the betrayal before the end of the investigation. How should the prisoners act? In the Iterated Prisoner's Dilemma (IPD), the game is played repeatedly. In the current Agent-based simulation there are several agents playing IPD, and their score is cumulated each turn using the following rules: The exported Fables project can be downloaded here.
To import the model, select File --> Import and chose the Fables / Fables Project wizard. |
|
Read more...
|
|
The Model
The El Farol model was described by Brian W. Arthur. This implementation of the model based on the NetLogo version, which may give a good opportunity to compare the languages. 
The model is about a bar close to the Santa Fé Institute where every Thursday workers decide to visit the pub or stay at home. Unfortunately, the bar is a bit small and the time spent there only worth it if less than the 60% of the population goes to the bar due to overcrowdedness. However, if the bar was overcrowded, the people stayed at home had a good time. Agents have to decide their actions at the same time, and they do not know anything about the opinions of the other agents. The only information available for them is the last weeks' occupancies. In this way they cannot see if it is worth visiting the bar before their decision.
An interesting fact of the problem is that there is no deterministic strategy for the agents. If each agent use the same strategy and decide in the same way, it would mean they do the same actions as the others and come to the same (bad) decision. For instance, if a strategy implies that the bar will not be crowded, everyone (following the same strategy) goes to the bar and it becomes crowded. In the other case, if strategy implies that the bar will be crowded, nobody will visit the bar and it remains empty. The model is closely related to minority games. The exported Fables project can be downloaded here.
To import the model, select File --> Import and chose the Fables / Fables Project wizard. |
|
Read more...
|
|
The Model The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is the best-known example of a cellular automaton. The model is actually a zero-player game, meaning that its evolution is determined by its initial state. There is no need for input from human players during the run, hence it the agent-based model architecture is a perfect fit for it. 
This model is an example implementation of Game of Life, download it here.
Just unpack the downloaded archive into the sample directory of the Fables IME installation. The model is accessable through the Example Project Wizard afterwards. |
|
Read more...
|
|
|
|
|
|
|
