Collective Intelligence and Braess' Paradox

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 104-109

  Tumer, Kagan ^a   Wolpert, David ^a  

^a NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; INTELLIGENT AGENTS; LEARNING SYSTEMS; NETWORK ROUTING;

BRAESS'S PARADOX; COLLECTIVE INTELLIGENCES; COMPUTER EXPERIMENT; CONTROL NETWORK; CONVENTIONAL APPROACH; INTELLIGENCE ALGORITHMS; LOW-COSTS; MACHINE-LEARNING; SHORT PATH ROUTING; SIDE EFFECT;

MULTI AGENT SYSTEMS;

EID: 85158118268     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Bass, T. 1992. Road to ruin. Discover 56-61.
2. Bertsekas, D., and Gallager, R. 1992. Data Networks. Englewood Cliffs, NJ: Prentice Hall.
3. Boyan, J. A., and Littman, M. 1994. Packet routing in dynamically changing networks: A reinforcement learning approach. In Advances in Neural Information Processing Systems - 6, 671-678. Morgan Kaufmann.
4. Cohen, J. E., and Jeffries, C. 1997. Congestion resulting from increased capacity in single-server queueing networks. IEEE/ACM Transactions on Networking 5(2):305-310.
5. Cohen, J. E., and Kelly, F. P. 1990. A paradox of congestion in a queuing network. Journal of Applied Probability 27:730-734.
6. Fudenberg, D., and Tirole, J. 1991. Game Theory. Cambridge, MA: MIT Press.
7. Hardin, G. 1968. The tragedy of the commons. Science 162:1243-1248.
8. Heusse, M.; Snyers, D.; Guerin, S.; and Kuntz, P. 1998. Adaptive agent-driven routing and load balancing in communication networks. Advances in Complex Systems 1:237-254.
9. Huhns, M. E., ed. 1987. Distributed Artificial Intelligence. London: Pittman.
10. Kaelbing, L. P.; Littman, M. L.; and Moore, A. W. 1996. Reinforcement learning: A survey. Journal of Artificial Intelligence Research 4:237-285.
11. Korilis, Y. A.; Lazar, A. A.; and Orda, A. 1995. Architechting noncooperative networks. IEEE Journal on Selected Areas in Communications 13(8).
12. Korilis, Y. A.; Lazar, A. A.; and Orda, A. 1997. Achieving network optima using Stackelberg routing strategies. IEEE/ACM Transactions on Networking 5(1):161-173.
13. Sandholm, T., and Lesser, V. R. 1995. Issues in automated negotiations and electronic commerce: extending the contract net protocol. In Proceedings of the Second International Conference on Multi-Agent Systems, 328-335. AAAI Press.
14. Subramanian, D.; Druschel, P.; and Chen, J. 1997. Ants and reinforcement learning: A case study in routing in dynamic networks. In Proceedings of the Fifteenth International Conference on Artificial Intelligence, 832-838.
15. Sutton, R. S., and Barto, A. G. 1998. Reinforcement Learning: An Introduction. Cambridge, MA: MIT Press.
16. Sutton, R. S. 1988. Learning to predict by the methods of temporal differences. Machine Learning 3:9-44.
17. Watkins, C., and Dayan, P. 1992. Q-learning. Machine Learning 8(3/4):279-292.
18. Wolpert, D. H., and Tumer, K. 2000a. Avoiding Braess' paradox through collective intelligence. Available as tech. rep. NASA-ARC-IC-99-124 from http://ic.arc.nasa.gov/ic/projects/coin_pubs.html.
19. Wolpert, D. H., and Tumer, K. 2000b. An Introduction to Collective Intelligence. In Bradshaw, J. M., ed., Handbook of Agent technology. AAAI Press/MIT Press. Available as tech. rep. NASA-ARC-IC-99-63 from http://ic.arc.nasa.gov/ic/projects/coin_pubs.html.
20. Wolpert, D. H.; Tumer, K.; and Frank, J. 1999. Using collective intelligence to route internet traffic. In Advances in Neural Information Processing Systems - 11, 952-958. MIT Press.
21. Wolpert, D. H.; Wheeler, K.; and Tumer, K. 2000. Collective intelligence for control of distributed dynamical systems. Europhysics Letters 49(6).