Related papers: Bonabeau model on fully occupied site graphs
Numerical simulations are reported on the Bonabeau model on a fully connected graph, where spatial degrees of freedom are absent. The control parameter is the memory factor f. The phase transition is observed at the dispersion of the agents…
Agent-based models describing social interactions among individuals can help to better understand emerging macroscopic patterns in societies. One of the topics which is worth tackling is the formation of different kinds of hierarchies that…
We study a model of competition among nomadic agents for time-varying and location-specific resources, arising in crowd-sourced transportation services, online communities, and traditional location-based economic activity. This model…
What basic processes generate hierarchy in a collective? The Bonabeau model provides us a simple mechanism based on randomness which develops self-organization through both winner/looser effects and relaxation process. A phase transition…
We consider a model of nomadic agents exploring and competing for time-varying location-specific resources, arising in crowdsourced transportation services, online communities, and in traditional location based economic activity. This model…
The 1995 model of Bonabeau et al is generalized by giving each individual a different ability to win or lose a fight. We also introduce different groups such that the losers of fights between different groups are eliminated. The overall…
The model of Bonabeau explains the emergence of social hierarchies from the memory of fights in an initially egalitarian society. Introducing a feedback from the social inequality into the probability to win a fight, we find a sharp…
A model of Boolean agents competing in a market is presented where each agent bases his action on information obtained from a small group of other agents. The agents play a competitive game that rewards those in the minority. After a long…
We present a linear agent based model on brand competition. Each agent belongs to one of the two brands and interacts with its nearest neighbors. In the process the agent can decide to change to the other brand if the move is beneficial.…
This paper addresses the bipartite consensus-control problem in open multi-agent systems containing both cooperative and antagonistic interactions. In these systems, new agents can join and new interactions can be formed over time.…
This work studies a dynamic, adversarial resource allocation problem in environments modeled as graphs. A blue team of defender robots are deployed in the environment to protect the nodes from a red team of attacker robots. We formulate the…
We here present a fixed agents version of an original model of the emergence of hierarchies among social agents first introduced by Bonabeau \textit{et al}. Having interactions occurring on a social network rather than among 'walkers'…
The game of cops and robbers is played on a fixed (finite or infinite) graph $G$. The cop chooses his starting position, then the robber chooses his. After that, they take turns and move to adjacent vertices, or stay at their current…
Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed computing as they mimic autonomous biologic entities. The…
The model of Bonabeau et al explains social hierarchies as random: People keep a memory of recent fights, and winners have a higher probability to win again. The question of phase transition and the generalization from square lattices to…
We consider zero-sum games in which players move between adjacent states, where in each pair of adjacent states one state dominates the other. The states in our game can represent positional advantages in physical conflict such as high…
This paper investigates control laws allowing mobile, autonomous agents to optimally position themselves on the line for distributed sensing in a nonuniform field. We show that a simple static control law, based only on local measurements…
We model a system of networking agents that seek to optimize their centrality in the network while keeping their cost, the number of connections they are participating in, low. Unlike other game-theory based models for network evolution,…
We study a lattice model of ``commons'', where a resource is shared locally among the agents of various cooperative tendency. The payoff function of an agent is proportional to the fraction of his operation rate and the net output of the…
An edge-colored directed graph is \emph{observable} if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge colors. When the agent is able to determine his…