Collective Intelligence, Data Routing and Braess' Paradox

We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system (MAS) so that they work synergistically to maximize a global utility. The particular problem domain we explore is the control of network routing by placing agents on all the routers in the network. Conventional approaches to this task have the agents all use the Ideal Shortest Path routing Algorithm (ISPA). We demonstrate that in many cases, due to the side-effects of one agent's actions on another agent's performance, having agents use ISPA's is suboptimal as far as global aggregate cost is concerned, even when they are only used to route in

• Type: Journal
• Year: 2002
• Where: JAIR
• Authors: David Wolpert, Kagan Tumer
• Keywords: Global Utility, Ideal Shortest Path, JAIR 2002, Utility Functions