Computational Model Library

Displaying 10 of 364 results for "Emmanuel Mhike Hove" clear search

Agent-based modeling and simulation (ABMS) is a class of computational models for simulating the actions and interactions of autonomous agents with the goal of assessing their effects on a system as a whole. Several frameworks for generating parallel ABMS applications have been developed taking advantage of their common characteristics, but there is a lack of a general benchmark for comparing the performance of generated applications. We propose and design a benchmark that takes into consideration the most common characteristics of this type of applications and includes parameters for influencing their relevant performance aspects. We provide an initial implementation of the benchmark for RepastHPC one of the most popular parallel ABMS platforms, and we use it for comparing the applications generated by these platforms.

Agent-based modeling and simulation (ABMS) is a class of computational models for simulating the actions and interactions of autonomous agents with the goal of assessing their effects on a system as a whole. Several frameworks for generating parallel ABMS applications have been developed taking advantage of their common characteristics, but there is a lack of a general benchmark for comparing the performance of generated applications. We propose and design a benchmark that takes into consideration the most common characteristics of this type of applications and includes parameters for influencing their relevant performance aspects. We provide an initial implementation of the benchmark for FLAME one of the most popular parallel ABMS platforms, and we use it for comparing the applications generated by these platforms.

Evolution of Conditional Cooperation

M Manning Marco Janssen Oyita Udiani | Published Thursday, August 01, 2013 | Last modified Friday, May 13, 2022

Cultural group selection model used to evaluate the conditions for agents to evolve who have other-regarding preferences in making decisions in public good games.

We model the relationship between natural resource user´s individual time preferences and their use of destructive extraction method in the context of small-scale fisheries.

Peer reviewed Least cost path mobility

Colin Wren Claudine Gravel-Miguel | Published Saturday, September 02, 2017 | Last modified Monday, October 04, 2021

This model aims to mimic human movement on a realistic topographical surface. The agent does not have a perfect knowledge of the whole surface, but rather evaluates the best path locally, at each step, thus mimicking imperfect human behavior.

Our aim is to demonstrate how conversational AI systems, exemplified by ChatGPT, can support the conceptualisation of Agent-Based Social Simulation (ABSS) models, leading to a full ABSS model design document. Through advanced prompt engineering and adherence to the Engineering ABSS framework (Siebers and Klügl 2017), we have constructed a comprehensive script that is easy to use and that supports the design of ABSS models with or even by AI. The performance of the script is demonstrated through an illustrative case study related to the use of adaptive architecture in museums. The repository contains (1) the comprehensive script in a format that allows copying and pasting prompts for use with ChatGPT, (2) the results of the illustrative case study in the form of two conceptual ABSS models, the ground truth and the autogenerated version.

Ant Colony Optimization for infrastructure routing

Igor Nikolic Emile Chappin P W Heijnen | Published Wednesday, March 05, 2014 | Last modified Saturday, March 24, 2018

The mode implements a variant of Ant Colony Optimization to explore routing on infrastructures through a landscape with forbidden zones, connecting multiple sinks to one source.

00 PSoup V1.22 – Primordial Soup

Garvin Boyle | Published Thursday, April 13, 2017

PSoup is an educational program in which evolution is demonstrated, on the desk-top, as you watch. Blind bugs evolve sophisticated heuristic search algorithms to be the best at finding food fast.

06b EiLab_Model_I_V5.00 NL

Garvin Boyle | Published Saturday, October 05, 2019

EiLab - Model I - is a capital exchange model. That is a type of economic model used to study the dynamics of modern money which, strangely, is very similar to the dynamics of energetic systems. It is a variation on the BDY models first described in the paper by Dragulescu and Yakovenko, published in 2000, entitled “Statistical Mechanics of Money”. This model demonstrates the ability of capital exchange models to produce a distribution of wealth that does not have a preponderance of poor agents and a small number of exceedingly wealthy agents.

This is a re-implementation of a model first built in the C++ application called Entropic Index Laboratory, or EiLab. The first eight models in that application were labeled A through H, and are the BDY models. The BDY models all have a single constraint - a limit on how poor agents can be. That is to say that the wealth distribution is bounded on the left. This ninth model is a variation on the BDY models that has an added constraint that limits how wealthy an agent can be? It is bounded on both the left and right.

EiLab demonstrates the inevitable role of entropy in such capital exchange models, and can be used to examine the connections between changing entropy and changes in wealth distributions at a very minute level.

Peer reviewed MADTOR: Model for Assessing Drug Trafficking Organizations Resilience

Deborah Manzi | Published Friday, February 23, 2024 | Last modified Friday, February 27, 2026

Criminal organizations operate in complex changing environments. Being flexible and dynamic allows criminal networks not only to exploit new illicit opportunities but also to react to law enforcement attempts at disruption, enhancing the persistence of these networks over time. Most studies investigating network disruption have examined organizational structures before and after the arrests of some actors but have disregarded groups’ adaptation strategies.
MADTOR simulates drug trafficking and dealing activities by organized criminal groups and their reactions to law enforcement attempts at disruption. The simulation relied on information retrieved from a detailed court order against a large-scale Italian drug trafficking organization (DTO) and from the literature.
The results showed that the higher the proportion of members arrested, the greater the challenges for DTOs, with higher rates of disrupted organizations and long-term consequences for surviving DTOs. Second, targeting members performing specific tasks had different impacts on DTO resilience: targeting traffickers resulted in the highest rates of DTO disruption, while targeting actors in charge of more redundant tasks (e.g., retailers) had smaller but significant impacts. Third, the model examined the resistance and resilience of DTOs adopting different strategies in the security/efficiency trade-off. Efficient DTOs were more resilient, outperforming secure DTOs in terms of reactions to a single, equal attempt at disruption. Conversely, secure DTOs were more resistant, displaying higher survival rates than efficient DTOs when considering the differentiated frequency and effectiveness of law enforcement interventions on DTOs having different focuses in the security/efficiency trade-off.
Overall, the model demonstrated that law enforcement interventions are often critical events for DTOs, with high rates of both first intention (i.e., DTOs directly disrupted by the intervention) and second intention (i.e., DTOs terminating their activities due to the unsustainability of the intervention’s short-term consequences) culminating in dismantlement. However, surviving DTOs always displayed a high level of resilience, with effective strategies in place to react to threatening events and to continue drug trafficking and dealing.

Displaying 10 of 364 results for "Emmanuel Mhike Hove" clear search

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept