This is a replication model of the matching problem including the mate search problem, which is the generalization of a traditional optimization problem.

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”

This model is designed to show the effects of personality types and student organizations have on ones chance to making friendships in a university setting. As known from psychology studies, those that are extroverted have an easier chance making friendships in comparison to those that are introverted.
Once every tick a pair of students (nodes) will be randomly selected they will then have the chance to either be come friends or not (create an edge or not) based on their personality type (you are able to change what the effect of each personality is) and whether or not they are in the same club (you can change this value) then the model triggers the next tick cycle to begin.

This model demonstrates the spread of collapse through a network. The model is abstract but has many applications in various fields.

We investigate the interplay of homophily, differentiation, and in-group cooperation mechanisms on the formation of opinion clusters and emergence of radical opinions.

This is a set of threshold public goods games models. Set consists of baseline model, endogenous shared punishment model, endogenous shared punishment model with activists and cooperation model. In each round, all agents are granted a budget of size set in GUI. Then they decide on how much they contribute to public goods and how much they keep. Public goods are provided only if the sum of contributions meets or exceeds the threshold defined in the GUI. After each round agents evaluate their strategy and payoff from this strategy.

This model simulates different spread hypotheses proposed for the introduction of agriculture on the Iberian peninsula. We include three dispersal types: neighborhood, leapfrog, and ideal despotic distribution (IDD).

NetCommons simulates a social dilemma process in case of step-level public goods. Is possible to generate (or load from DL format) any different networks, to change initial parameters, to replicate a number of experimental situations, and to obtain a event history database in CSV format with information about the context of each agents’ decision, the individual behavior and the aggregate outcomes.

We present an agent-based model that maps out and simulates the processes by which individuals within ecological restoration organizations communicate and collectively make restoration decisions.

We construct a new type of agent-based model (ABM) that can simultaneously simulate land-use changes at multiple distant places (namely TeleABM, telecoupled agent-based model). We use soybean trade between Brazil and China as an example, where Brazil is the sending system and China is the receiving system because they are the world’s largest soybean exporter and importer respectively. We select one representative county in each country to calibrate and validate the model with spatio-temporal analysis of historical land-use changes and the empirical analysis of household survey data. The whole model is programmed on RePast Simphony. The most unique features of TeleABM are that it can simulate a telecoupled system and the flows between sending and receiving systems in this telecoupled system.