Computational Model Library

Displaying 10 of 992 results for "J Van Der Beek" clear search

SBH trust model

Di Wang | Published Tuesday, December 14, 2010 | Last modified Saturday, April 27, 2013

This is a computational model to articulate the theory and test some assumption and axioms for the trust model and its relationship to SBH.

Societal Simulator v203

Tim Gooding | Published Tuesday, October 01, 2013 | Last modified Friday, November 28, 2014

Designed to capture the evolutionary forces of global society.

This model simulates the heterogeneity of preferences in a PG game and how the interaction between them affects the dynamics of voluntary contributions. Model is based on the results of a human-based experiment.

This model was designed to study resilience in organizations. Inspired by ethnographic work, it follows the simple goal to understand whether team structure affects the way in which tasks are performed. In so doing, it compares the ‘hybrid’ data-inspired structure with three more traditional structures (i.e. hierarchy, flexible/relaxed hierarchy, and anarchy/disorganization).

The wisdom of the crowd refers to the phenomenon in which a group of individuals, each making independent decisions, can collectively arrive at highly accurate solutions—often more accurate than any individual within the group. This principle relies heavily on independence: if individual opinions are unbiased and uncorrelated, their errors tend to cancel out when averaged, reducing overall bias. However, in real-world social networks, individuals are often influenced by their neighbors, introducing correlations between decisions. Such social influence can amplify biases, disrupting the benefits of independent voting. This trade-off between independence and interdependence has striking parallels to ensemble learning methods in machine learning. Bagging (bootstrap aggregating) improves classification performance by combining independently trained weak learners, reducing bias. Boosting, on the other hand, explicitly introduces sequential dependence among learners, where each learner focuses on correcting the errors of its predecessors. This process can reinforce biases present in the data even if it reduces variance. Here, we introduce a new meta-algorithm, casting, which captures this biological and computational trade-off. Casting forms partially connected groups (“castes”) of weak learners that are internally linked through boosting, while the castes themselves remain independent and are aggregated using bagging. This creates a continuum between full independence (i.e., bagging) and full dependence (i.e., boosting). This method allows for the testing of model capabilities across values of the hyperparameter which controls connectedness. We specifically investigate classification tasks, but the method can be used for regression tasks as well. Ultimately, casting can provide insights for how real systems contend with classification problems.

barterNet

Jon Pearce Justin Rietz | Published Wednesday, January 08, 2025

BarterNet is a platform for modeling early barter networks with the aim of learning how supply and demand for a good determine if traders will learn to use that good as a form of money. Traders use a good as money when they offer to trade for it even if they can’t consume it, but believe that they can subsequently trade it for a good they can consume in the near future.

A Complex Model of Voter Turnout

Bruce Edmonds Laurence Lessard-Phillips Ed Fieldhouse | Published Monday, October 13, 2014 | Last modified Tuesday, August 18, 2015

This is a complex “Data Integration Model”, following a “KIDS” rather than a “KISS” methodology - guided by the available evidence. It looks at the complex mix of social processes that may determine why people vote or not.

Irrigation Equity and Efficiency

Andrew Bell | Published Tuesday, August 30, 2016

The purpose of this model is to examine equity and efficiency in crop production across a system of irrigated farms, as a function of maintenance costs, assessed water fees, and the capacity of farmers to trade water rights among themselves.

This project combines game theory and genetic algorithms in a simulation model for evolutionary learning and strategic behavior. It is often observed in the real world that strategic scenarios change over time, and deciding agents need to adapt to new information and environmental structures. Yet, game theory models often focus on static games, even for dynamic and temporal analyses. This simulation model introduces a heuristic procedure that enables these changes in strategic scenarios with Genetic Algorithms. Using normalized 2x2 strategic-form games as input, computational agents can interact and make decisions using three pre-defined decision rules: Nash Equilibrium, Hurwicz Rule, and Random. The games then are allowed to change over time as a function of the agent’s behavior through crossover and mutation. As a result, strategic behavior can be modeled in several simulated scenarios, and their impacts and outcomes can be analyzed, potentially transforming conflictual situations into harmony.

Customers going to a restaurant

hdouss | Published Tuesday, September 25, 2018

The model is about customers going to a restaurant when they are hungry. They wait in the queue if no tables are available. Customers can leave the restaurant and got upset and decide to never return to the restaurant. The model tries to show 2 things: 1.the main caracteristics of the people that decided to never return to the restaurant and 2.the main factors that can impact the total number of customers that decided to never return to the restaurant.

Displaying 10 of 992 results for "J Van Der Beek" 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