Computational Model Library

Displaying 10 of 166 results for "Janne M Korhonen" clear search

This multi-model (i.e. a model composed of interacting submodels) is a multi-level representation of a collective motion phenomenon. It was designed to study the impact of the mutual influences between individuals and groups in collective motion.

Peer reviewed Modelling the Social Complexity of Reputation and Status Dynamics

André Grow Andreas Flache | Published Wednesday, February 01, 2017 | Last modified Wednesday, January 23, 2019

The purpose of this model is to illustrate the use of agent-based computational modelling in the study of the emergence of reputation and status beliefs in a population.

Symmetric two-sided matching

Naoki Shiba | Published Wednesday, January 09, 2013 | Last modified Wednesday, May 29, 2013

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

Peer reviewed Credit and debt market of low-income families

Márton Gosztonyi | Published Tuesday, December 12, 2023 | Last modified Friday, January 19, 2024

The purpose of the Credit and debt market of low-income families model is to help the user examine how the financial market of low-income families works.

The model is calibrated based on real-time data which was collected in a small disadvantaged village in Hungary it contains 159 households’ social network and attributes data.
The simulation models the households’ money liquidity, expenses and revenue structures as well as the formal and informal loan institutions based on their network connections. The model forms an intertwined system integrated in the families’ local socioeconomic context through which families handle financial crises and overcome their livelihood challenges from one month to another.
The simulation-based on the abstract model of low-income families’ financial survival system at the bottom of the pyramid, which was described in following the papers:

Asymmetric two-sided matching

Naoki Shiba | Published Wednesday, January 09, 2013 | Last modified Tuesday, May 28, 2013

This model is an extended version of the matching problem including the mate search problem, which is the generalization of a traditional optimization problem. The matching problem is extended to a form of asymmetric two-sided matching problem.

This is a ridesharing model (Uber/Lyft) of the larger Washington DC metro area. The model can be modified (Netlogo 6.x) relatively easily and be adapted to any metro area. Please cite generously (this was a lot of work) and please cite the paper, not the comses model.

Link to the paper published in “Complex Adaptive Systems” here: https://link.springer.com/chapter/10.1007/978-3-030-20309-2_7

Citation: Shaheen J.A.E. (2019) Simulating the Ridesharing Economy: The Individual Agent Metro-Washington Area Ridesharing Model (IAMWARM). In: Carmichael T., Collins A., Hadžikadić M. (eds) Complex Adaptive Systems. Understanding Complex Systems. Springer, Cham. https://doi.org/10.1007/978-3-030-20309-2_7

The model employs an agent-based model for exploring the victim-centered approach to identifying human trafficking and the approach’s effectiveness in an abstract representation of migrant flows.

The purpose of the model is to examine whether and how mobile pastoralists are able to achieve an Ideal Free Distribution (IFD).

Opinion Dynamics Under Intergroup Conflict Escalation

Meysam Alizadeh Alin Coman Michael Lewis Katia Sycara | Published Friday, March 14, 2014 | Last modified Wednesday, October 29, 2014

We develop an agent-based model to explore the effect of perceived intergroup conflict escalation on the number of extremists. The proposed model builds on the 2D bounded confidence model proposed by Huet et al (2008).

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.

Displaying 10 of 166 results for "Janne M Korhonen" 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