Turner, R. M. (1993): "The Tragedy of the Commons and Distributed AI Systems", in Proceedings of the 12th International Workshop on Distributed Artificial Intelligence, Hidden Valley, PA.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the eciency of the system. They call this phenomena computational dilemmas, and nd that nondilemma cases are exceptions rather than the norm. One way to avoid social dilemmas is to privatize the resources. This is because the shared resources are in fact subject to the tragedy of the commons [Har68,Tur93]. An example of a problem with a computational dilemma is depicted in gure 3.5.4, where cars have to choose which road to travel. The computational 16 dilemma makes the cars travel more slowly when a new road is added to the system. 1 1 0.5 f 2 0.5 f 1 1 1 0.5 f 2 0.5 f 1 x Avg. ....

Roy M. Turner. The tragedy of the commons and distributed ai systems. In Proceedings of the 12th International Workshop on Distributed Articial Intelligence, Hidden Valley, PA, May, May

....preferably one that does not have a single point of failure. In addition, malicious sources can flood routing tables with invalid entries. Likewise, content requestors can overload the system by sending large amounts of requests. Deregistration of content and privatization of routing tables [22] could be possible solution to these problems, but have yet to be explored in depth. It may Figure 8. Content clustering 12 be possible to build a trust management system into the network to help control some of these security issues. 6 System Analysis Two simulations were conducted to analyze ....

Turner, R. M., "The Tragedy of the Commons and Distributed AI Systems," in Proceedings of the 12th International Workshop on Distributed Artificial Intelligence, Hidden Valley, PA, USA, 1993

....efficiency of the system. They call this phenomena computational dilemmas, and find that nondilemma cases are exceptions rather than the norm. One way to avoid social dilemmas is to privatize the resources. This is because the shared resources are in fact subject to the tragedy of the commons [Har68,Tur93]. An example of a problem with a computational dilemma is depicted in figure 3.5.4, where cars have to choose which road to travel. The computational 16 dilemma makes the cars travel more slowly when a new road is added to the system. 1 1 0.5 f 2 0.5 f 1 1 1 0.5 f 2 0.5 f 1 x Avg. ....

Roy M. Turner. The tragedy of the commons and distributed ai systems. In Proceedings of the 12th International Workshop on Distributed Artificial Intelligence, Hidden Valley, PA, May, May 1993. http://cdps.umcs.maine.edu/Papers/1993/TofCommons/TR.html.

....pasture. Hardin [8] observes that Freedom in a commons brings ruin to all. and convincingly argues that enforced laws, and not appeals to conscience, is necessary to avoid the tragedy of the commons. Recently, attention has been drawn to this problem in the context of autonomous agent systems [23]. Braess Paradox: Consider a resource sharing problem where the cost of utilizing a resource increases with the number of agents sharing it (for example, congestion on traffic lanes) Assume that initially the agents are randomly assigned to one of two identical resources. Now, if every agent ....

....Encouraged by our initial results from the Tragedy of the Commons and Braess s paradox problems, we plan to test the adaptive systems approach to larger, more complex social dilemma situations. Social dilemmas are not restricted to human societies and are bound to plague artificial social systems [4, 11, 23], e.g. message congestion problems. A naive design and implementation of agent societies, therefore, will be likely to lead to ineffective utilization of resources. Given an environment, we can evolve agent societies that optimally utilize the resources available to it. The model proposed in this ....

Roy M. Turner. The tragedy of the commons and distributed ai systems. In Working Papers of the 12th International Workshop on Distributed Artificial Intelligence, pages 379--390, May 1993.

....be better off by less congested communication links by restricted sending, but each agent sends as long as the expected utility from that message exceeds the decrease in utility to that agent caused by the congesting effect of that message in the media. This defines a tragedy of the commons [ Turner, 1992; Hardin, 1968 ] n player prisoners dilemma) The tragedy occurs only for low commitment messages (usually early in a negotiation) having multiple high commitment offers out simultaneously increases an agent s negotiation risk (Sec. 2.2) and computation costs (Sec. 3) The obvious way to ....

Roy M Turner. The tragedy of the commons and distributed ai systems. In Proceedings of the 12th International Workshop on Distributed Artificial Intelligence, pages 379--390, May 1992.

No context found.

Turner, R. M. (1993): "The Tragedy of the Commons and Distributed AI Systems", in Proceedings of the 12th International Workshop on Distributed Artificial Intelligence, Hidden Valley, PA.

No context found.

Roy M. Turner. The tragedy of the commons and distributed ai systems. In Twelfth International Workshop on Distributed Artificial Intelligence, pages 379-- 390, Hidden Valley, PA, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC