Related papers: Exact time-dependent dynamics of discrete binary c…

In this paper I present several algorithmic techniques for improving the decision process of multiple types of agents behaving in environments where their interests are in conflict. The interactions between the agents are modelled by using…

We present numerical simulations of a model of social influence, where the opinion of each agent is represented by a binary vector. Agents adjust their opinions as a result of random encounters, whenever the difference between opinions is…

Random pairwise encounters often occur in large populations, or groups of mobile agents, and various types of local interactions that happen at encounters account for emergent global phenomena. In particular, in the fields of swarm…

The dynamic vehicle dispatching problem corresponds to deciding which vehicles to assign to requests that arise stochastically over time and space. It emerges in diverse areas, such as in the assignment of trucks to loads to be transported;…

In this work the system of agents is applied to establish a model of the nonlinear distributed signal processing. The evolution of the system of the agents - by the prediction time scale diversified trend followers, has been studied for the…

This paper studies the impact of the initial data gathering method on the subsequent learning of a dynamics model. Dynamics models approximate the true transition function of a given task, in order to perform policy search directly on the…

We consider a random financial network with a large number of agents. The agents connect through credit instruments borrowed from each other or through direct lending, and these create the liabilities. The settlement of the debts of various…

We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining ones, the former group is also influenced by the remaining ones…

We study a sequential resource allocation problem where a decision maker selects subsets of agents at each period to maximize overall outcomes without prior knowledge of individual-level effects. Our framework applies to settings such as…

We study a discrete-time consensus model in which agents iteratively update their states through interactions on a dynamic social network. At each step, a single agent is selected asynchronously and averages the values of its current…

We consider the problem of efficiently simulating population protocols. In the population model, we are given a distributed system of $n$ agents modeled as identical finite-state machines. In each time step, a pair of agents is selected…

Simulation of population dynamics is a central research theme in computational biology, which contributes to understanding the interactions between predators and preys. Conventional mathematical tools of this theme, however, are incapable…

We investigate an averaging process that describes how interacting agents approach consensus through binary interactions. In each elementary step, two agents are selected at random and they reach compromise by adopting their opinion…

We investigate model assessment and selection in a changing environment, by synthesizing datasets from both the current time period and historical epochs. To tackle unknown and potentially arbitrary temporal distribution shift, we develop…

In this work, we examine a kinetic framework for modeling the time evolution of size distribution densities of two populations governed by predator-prey interactions. The model builds upon the classical Boltzmann-type equations, where the…

The dynamic allocation problem, also known as the `multi-armed bandit' problem, simulates a situation in which an agent is faced with a tradeoff between actions that yield an immediate reward and actions whose benefits can only be perceived…

We introduce a stochastic agent-based model for the flocking dynamics of self-propelled particles that exhibit velocity-alignment interactions with neighbours within their field of view. The stochasticity in the dynamics of the model arises…

We propose an exactly solvable model for the dynamics of voters in a two-party system. The opinion formation process is modeled on a random network of agents. The dynamical nature of interpersonal relations is also reflected in the model,…

As a schematic model of the complexity economic agents are confronted with, we introduce the ``SK-game'', a discrete time binary choice model inspired from mean-field spin-glasses. We show that even in a completely static environment,…

In this paper, we formulate and solve a randomized optimal consensus problem for multi-agent systems with stochastically time-varying interconnection topology. The considered multi-agent system with a simple randomized iterating rule…