We reconstruct Cohen, March and Olsen’s Garbage Can model of organizational choice as an agent-based model. We add another means for avoiding making decisions: buck-passing difficult problems to colleagues.

This models simulate how people choose their food buyings based on a limited budget and a food quality index. In order to make the choice the agents call a genetic algorithm who optimizes the buying. The agents are distributed randomly and there are 5 store options where agents can buy meat, fruits and vegetables, bread, ultraprocessed and medications. Agents need all of them, each of one has a different price and a different quality index. The genetic algorithm perform an optimization procedure in order to clasiffy what food set is the best for each agent. The agents are coloured based on their budget if the’ve got less than 100, then they are pink otherwise they are white.

This is a NetLogo 7.0.1 agent-based model of interdependent team productivity under O-ring production logic. The model asks when collective problem-solving capacity (CPS) improves team output and when its effect is constrained by trust, burnout, specialization diversity, weak-link quality, and team-formation rules. Agents are heterogeneous in skill, CPS, trust, burnout, effort, learning rate, openness, specialization, adaptability, and aspiration. Each tick forms temporary teams, computes individual contribution quality, combines contributions through a geometric O-ring production function with an explicit weakest-link term, records output and success, and updates agents through feedback, learning, trust change, burnout, recovery, and turnover. The paper follows the ODD protocol, reports exact implementation equations, and analyzes six BehaviorSpace experiments with 50 stochastic repetitions per condition. Scenario results show that CPS is beneficial but not sufficient: productivity is highest when CPS is combined with trust, low burnout, effective coordination, and a reliable weakest-link floor. Diversity yields only modest gains at low CPS but larger gains when CPS is high. Formation-mode results are especially informative because mixed CPS-skill formation maximizes total output, whereas random formation has the highest binary success rate, showing that output magnitude and threshold success can diverge. The study contributes a transparent computational mechanism linking collective intelligence with O-ring production and identifies boundary conditions under which high-CPS teams can still be limited by weak links and interdependence.

An empirical-response agent-based model of how many personalized feeds execute a shared low-exposure creator-discovery objective. Built from the KuaiRec dataset: the big interaction matrix initializes a transparent rank-8 matrix-factorization platform learner and the activity schedule, while the near-complete small matrix returns observed viewing responses only after a user-video pair is exposed. Four exploration policies (synchronous low-exposure targeting, uniform exploration, per-user random tie-breaking, capacity-balanced coordination) are compared over 28 rounds at a nominal 10% exploration budget, across 30 paired seeds (core) and 10 paired seeds (bias-only probe), with slot-level redundancy, cross-user collision, and coverage diagnostics.
This release accompanies an anonymised manuscript under review at the Journal of Artificial Societies and Social Simulation.

The model represents 1,411 users, 3,327 videos, 2,031 authors, and an adaptive platform over 28 discrete rounds derived from the KuaiRec big-matrix activity calendar. Exploration policies differ only in how a fixed 10% slot budget is allocated; all policies share the opportunity schedule, response oracle, initial checkpoints, and online update rule.

Archive contents: analysis pipeline scripts (01-16), frozen machine-readable protocols with input hashes, initial model checkpoints, aggregate result tables, the complete ODD protocol record, and publication figures. Raw KuaiRec files are not redistributed; obtain them from the official dataset repository and verify against the input hashes in data_contract/. Row-level oracle tables are excluded by design.
…

Car-centric societies face challenges in transitioning to sustainable mobility,
with electric vehicle adoption depending on the interaction of consumer behaviour,
firm innovation, and policy incentives. To examine these dynamics, we develop an
agent-based model calibrated on California data from 2001–2023. Heterogeneous
consumers influence each other in their acceptance of EVs, while manufacturers
incorporate these changes into their innovation and product-mix strategies. We
…

This model tests whether local housing supply elasticity governs crash severity inside a single metropolitan housing market. Saiz (2010) established that across US metros, regions constrained by geography and regulation experience deeper boom-bust cycles than flexible ones. That finding is routinely applied downward to neighborhoods and ZIP codes as though the mechanism scaled without qualification.

The empirical record for the Washington DC and Northern Virginia region says it does not. Across 84 ZIP codes, measured supply elasticity ranges from 0.35 to 4.95 with a median of 1.21. The worst single-year price decline between 2007 and 2012 averaged 9.6 percent in constrained ZIP codes and 9.0 percent in flexible ones, a gap that cannot be distinguished from noise. Wide variation in the proposed cause, no meaningful separation in the proposed effect.

The model embeds households, houses and a metro-wide credit condition in the real ZIP geography of the region using three GIS layers and an empirical price panel. Local elasticity governs construction, exactly as theory predicts. Prices are driven by a shared macro drift schedule and, under the credit-amplified mode, by a leverage cycle with a financial accelerator and a deviation penalty. The design question is whether those shared forces are sufficient to override local supply differences at the sub-metropolitan scale.

…

The Oussa Pañn model is an agent-based representation of the social-ecological system embedded in the Oussa Pañn role-playing game. It represents shellfish harvesters making individual livelihood decisions between harvesting renewable shellfish resources from mudflats and engaging in alternative income-generating activities in a village. The model was developed to (i) compare simulated and observed game trajectories, (ii) verify the internal consistency of recorded game data, and (iii) provide a baseline against which observed player behaviour can be compared, notably through random decision-making scenarios.

This entry provides an Agent-Based Model (ABM) of opinion and tolerance dynamics in artificial societies, implemented in the frame of the Concord/Partial Antagonism (C/PA) model. This version is specifically designed to investigate the impact of asymmetric influence through two leadership archetypes—Dictator and Democrat—within networked societies.
The model is highly modular, allowing the user to simulate three distinct social scenarios:
Baseline C/PA: Self-organization of a society without external influence.
Stubborn Leadership: Introduction of a “solid conviction” leader (Dictator or Democrat) who exerts constant pressure without changing their own stance.
Feedback Leadership: A democratic leader receptive to social feedback, where the leader’s opinion evolves based on interactions with the population.
Theoretical Foundations:
…

An integrated wildfire and urban growth model for informal settlements.

Fire-WCISG is developed to test the impact of different fire management strategies on the number and type of residents staying in an informal settlement, and the fire-dependent fynbos vegetation that it is next to.

The model uses a hybrid protection motivation theory, place attachment and Turner’s informal residents as described by Christ et al. (2023) (10.1016/j.habitatint.2023.102815), for the agents decision making. Wildland vegetation is based on published understanding of fynbos ecology.

…

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”