Matching of Agents

The topic of this section is how autonomously acting agents can be brought together algorithmicly. The technical matching of agents is a crucial part of the SILAS-model as agents need to be brought together for dating as well as mating purposes (see Agent Behavior).

Dantzig, GB (1963): Linear Programming and Extensions. Princeton: Princeton University Press.

Carpaneto, G; Martello, S; Toth, P (1988): Algorithms and Codes for the Assignment Problem. In: Annals of Operations Research (13): 193 -223.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: