Pair Formation within Multi-Agent Populations

Physics – Physics and Society

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Special Issue on Complex Networks, edited by Dirk Helbing

Scientific paper

10.1016/j.physa.2006.01.056

We present a simple model for the formation of pairs in multi-agent populations of type A and B which move freely on a spatial network. Each agent of population A (and B) is labeled as Ai (and Bj) with i=1,.. NA (and j=1,..NB) and carries its own individual list of characteristics or 'phenotype'. When agents from opposite populations encounter one another on the network, they can form a relationship if not already engaged in one. The length of time for which any given pair stays together depends on the compatibility of the two constituent agents. Possible applications include the human dating scenario, and the commercial domain where two types of businesses A and B have members of each type looking for a business partner, i.e. Ai+Bj-->Rij. The pair Rij then survives for some finite time before dissociating Rij-->Ai+Bj. There are many possible generalizations of this basic setup. Here we content ourselves with some initial numerical results for the simplest of network topologies, together with some accompanying analytic analysis.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Pair Formation within Multi-Agent Populations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pair Formation within Multi-Agent Populations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pair Formation within Multi-Agent Populations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-195878

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.