This repository contains a Python simulation script for studying network-based linguistic diversity. The model extends the classic Greenberg Diversity Index by introducing diversity measures defined over social ties rather than only over population shares. It also includes two extensions: a competence-conditioned version and a multilayer version.

The model implements a model that reflects features of a rural hill village in Nepal. Key features of the model include water storage, social capital and migration of household members who then send remittances back to the village.

We propose an agent-based model where a fixed finite population of tagged agents play iteratively the Nash demand game in a regular lattice. The model extends the bargaining model by Axtell, Epstein and Young.

Flibs’NLogo implements in NetLogo modelling environment, a genetic algorithm whose purpose is evolving a perfect predictor from a pool of digital creatures constituted by finite automata or flibs (finite living blobs) that are the agents of the model. The project is based on the structure described by Alexander K. Dewdney in “Exploring the field of genetic algorithms in a primordial computer sea full of flibs” from the vintage Scientific American column “Computer Recreations”.
As Dewdney summarized: “Flibs […] attempt to predict changes in their environment. In the primordial computer soup, during each generation, the best predictor crosses chromosomes with a randomly selected flib. Increasingly accurate predictors evolve until a perfect one emerges. A flib […] has a finite number of states, and for each signal it receives (a 0 or a 1) it sends a signal and enters a new state. The signal sent by a flib during each cycle of operation is its prediction of the next signal to be received from the environment”

A very simple model elaborated to explore what may happens when buyers (travelers) have more information than sellers (tourist destinations)

A demonstration model showing how modellers can create a multi regional tram network with commuters, destinations and houses. The model offers options to create a random tram network made from modeller input or to load shapefiles for the Greater Manchester Metrolink.

The model uses NetLogo with gis, nw an csv extensions.

IMine is a flexible framework which can be adopt multiple criteria for convergence to solve Influence Minig problems. It can use any diffusion model, as well as resilience to compute the influence of a set of nodes base on the use case.
The code is written and tested on ‘R’ v3.5

Agent-based model simulating 60 undergraduate CS students over 8 semesters to investigate how differential AI tool access affects academic inequality, performance distributions, and dependency formation. Implements a three-phase AI dependency mechanism (effort reduction, metacognitive miscalibration, capability erosion) under five policy scenarios with a 4,050-run parameter sensitivity sweep.

The model’s aim is to represent the price dynamics under very simple market conditions, given the values adopted by the user for the model parameters. We suppose the market of a financial asset contains agents on the hypothesis they have zero-intelligence. In each period, a certain amount of agents are randomly selected to participate to the market. Each of these agents decides, in a equiprobable way, between proposing to make a transaction (talk = 1) or not (talk = 0). Again in an equiprobable way, each participating agent decides to speak on the supply (ask) or the demand side (bid) of the market, and proposes a volume of assets, where this number is drawn randomly from a uniform distribution. The granularity depends on various factors, including market conventions, the type of assets or goods being traded, and regulatory requirements. In some markets, high granularity is essential to capture small price movements accurately, while in others, coarser granularity is sufficient due to the nature of the assets or goods being traded

A replication in Netlogo 5.2 of the classic model, Sugarscape (Epstein & Axtell, 1996).