Computational Model Library

Displaying 10 of 510 results for "Jingjing Cai" clear search

The model is based on the influence function of the Leviathan model (Deffuant, Carletti, Huet 2013 and Huet and Deffuant 2017) with the addition of group idenetity. We aim at better explaining some patterns generated by this model, using a derived mathematical approximation of the evolution of the opinions averaged.

We consider agents having an opinion/esteem about each other and about themselves. During dyadic meetings, agents change their respective opinion about each other, and possibly about other agents they gossip about, with a noisy perception of the opinions of their interlocutor. Highly valued agents are more influential in such encounters. Moreover, each agent belongs to a single group and the opinions within the group are attracted to their average.

We show that a group hierarchy can emerges from this model, and that the inequality of reputations among groups have a negative effect on the opinions about the groups of low status. The mathematical analysis of the opinion dynamic shows that the lower the status of the group, the more detrimental the interactions with the agents of other groups are for the opinions about this group, especially when gossip is activated. However, the interactions between agents of the same group tend to have a positive effect on the opinions about this group.

This model simulates the dynamics of agricultural land use change, specifically the transition between agricultural and non-agricultural land use in a spatial context. It explores the influence of various factors such as agricultural profitability, path dependency, and neighborhood effects on land use decisions.

The model operates on a grid of patches representing land parcels. Each patch can be in one of two states: exploited (green, representing agricultural land) or unexploited (brown, representing non-agricultural land). Agents (patches) transition between these states based on probabilistic rules. The main factors affecting these transitions are agricultural profitability, path dependency, and neighborhood effects.
-Agricultural Profitability: This factor is determined by the prob-agri function, which calculates the probability of a non-agricultural patch converting to agricultural based on income differences between agriculture and other sectors. -Path Dependency: Represented by the path-dependency parameter, it influences the likelihood of patches changing their state based on their current state. It’s a measure of inertia or resistance to change. -Neighborhood Effects: The neighborhood function calculates the number of exploited (agricultural) neighbors of a patch. This influences the decision of a patch to convert to agricultural land, representing the influence of surrounding land use on the decision-making process.

This paper investigates the impact of agents' trading decisions on market liquidity and transactional efficiency in markets for illiquid (hard-to-trade) assets. Drawing on a unique order book dataset from the fine wine exchange Liv-ex, we offer novel insights into liquidity dynamics in illiquid markets. Using an agent-based framework, we assess the adequacy of conventional liquidity measures in capturing market liquidity and transactional efficiency. Our main findings reveal that conventional liquidity measures, such as the number of bids, asks, new bids and new asks, may not accurately represent overall transactional efficiency. Instead, volume (measured by the number of trades) and relative spread measures may be more appropriate indicators of liquidity within the context of illiquid markets. Furthermore, our simulations demonstrate that a greater number of traders participating in the market correlates with an increased efficiency in trade execution, while wider trader-set margins may decrease the transactional efficiency. Interestingly, the trading period of the agents appears to have a significant impact on trade execution. This suggests that granting market participants additional time for trading (for example, through the support of automated trading systems) can enhance transactional efficiency within illiquid markets. These insights offer practical implications for market participants and policymakers aiming to optimise market functioning and liquidity.

Negotiation plays a fundamental role in shaping human societies, underpinning conflict resolution, institutional design, and economic coordination. This article introduces E³-MAN, a novel multi-agent model for negotiation that integrates individual utility maximization with fairness and institutional legitimacy. Unlike classical approaches grounded solely in game theory, our model incorporates Bayesian opponent modeling, transfer learning from past negotiation domains, and fallback institutional rules to resolve deadlocks. Agents interact in dynamic environments characterized by strategic heterogeneity and asymmetric information, negotiating over multidimensional issues under time constraints. Through extensive simulation experiments, we compare E³-MAN against the Nash bargaining solution and equal-split baselines using key performance metrics: utilitarian efficiency, Nash social welfare, Jain fairness index, Gini coefficient, and institutional compliance. Results show that E³-MAN achieves near-optimal efficiency while significantly improving distributive equity and agreement stability. A legal application simulating multilateral labor arbitration demonstrates that institutional default rules foster more balanced outcomes and increase negotiation success rates from 58% to 98%. By combining computational intelligence with normative constraints, this work contributes to the growing field of socially aware autonomous agents. It offers a virtual laboratory for exploring how simple institutional interventions can enhance justice, cooperation, and robustness in complex socio-legal systems.

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).

ADAM: Agent-based Demand and Assignment Model

D Levinson | Published Monday, August 29, 2011 | Last modified Saturday, April 27, 2013

The core algorithm is an agent-based model, which simulates travel patterns on a network based on microscopic decision-making by each traveler.

SONG - Simulation of Network Growth

D Levinson | Published Monday, August 29, 2011 | Last modified Saturday, April 27, 2013

SONG is a simulator designed for simulating the process of transportation network growth.

Model to assess factors that influence local communities compliance with protected areas policies

Gustavo Andrade | Published Monday, November 21, 2011 | Last modified Saturday, April 27, 2013

We built a model using R,polr package, to assess 55 published case studies from developing countries to determine what factors influence the level of compliance of local communities with protected area regulations.

Peer reviewed Horse population dynamics

Nika Galic | Published Tuesday, November 12, 2013 | Last modified Wednesday, October 29, 2014

This model investigates the link between prescribed growth in body size, population dynamics and density dependence through population feedback on available resources.

MERCURY: an ABM of tableware trade in the Roman East

Tom Brughmans Jeroen Poblome | Published Thursday, September 25, 2014 | Last modified Friday, May 01, 2015

MERCURY aims to represent and explore two descriptive models of the functioning of the Roman trade system that aim to explain the observed strong differences in the wideness of distributions of Roman tableware.

Displaying 10 of 510 results for "Jingjing Cai" 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