The Network Challenge (Chapter 8)

Artificial Intelligence: How Individual Agents Add Up to a Network

Business & Finance, Management & Leadership, Planning & Forecasting
Cover of the book The Network Challenge (Chapter 8) by Steven O. Kimbrough, Pearson Education
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Steven O. Kimbrough ISBN: 9780137015375
Publisher: Pearson Education Publication: May 19, 2009
Imprint: FT Press Language: English
Author: Steven O. Kimbrough
ISBN: 9780137015375
Publisher: Pearson Education
Publication: May 19, 2009
Imprint: FT Press
Language: English

Artificial intelligence (AI) offers computational methodologies for modeling systems, which can be valuable in understanding networks. In this chapter, the author examines several types of applications of these methods in exploring how the behavior of individual agents leads to outcomes across networks. For example, he considers how one system, based on a Prisoner’s Dilemma that provides a higher payoff for players who don’t cooperate, can result in a surprising outcome in which cooperation dominates after many rounds of play. He also considers agent-based models--including turtles in a pond, showing discrimination effects; and sugar and spice trading, showing interactions through trading. Finally, he explores applications to ant colony optimization and swarming optimization of flocks of birds or schools of fish. He concludes that computational models offer important insights into networks, and the procedures used in modeling have a significant impact. The discussion also demonstrates that “networks matter,” affecting outcomes in sometimes unpredictable ways.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

Artificial intelligence (AI) offers computational methodologies for modeling systems, which can be valuable in understanding networks. In this chapter, the author examines several types of applications of these methods in exploring how the behavior of individual agents leads to outcomes across networks. For example, he considers how one system, based on a Prisoner’s Dilemma that provides a higher payoff for players who don’t cooperate, can result in a surprising outcome in which cooperation dominates after many rounds of play. He also considers agent-based models--including turtles in a pond, showing discrimination effects; and sugar and spice trading, showing interactions through trading. Finally, he explores applications to ant colony optimization and swarming optimization of flocks of birds or schools of fish. He concludes that computational models offer important insights into networks, and the procedures used in modeling have a significant impact. The discussion also demonstrates that “networks matter,” affecting outcomes in sometimes unpredictable ways.

More books from Pearson Education

Cover of the book Exam Ref 70-487 Developing Windows Azure and Web Services (MCSD) by Steven O. Kimbrough
Cover of the book Agile Product Management with Scrum: Creating Products that Customers Love by Steven O. Kimbrough
Cover of the book People Analytics by Steven O. Kimbrough
Cover of the book Powering the Future by Steven O. Kimbrough
Cover of the book Think Like An Entrepreneur ePub eBook by Steven O. Kimbrough
Cover of the book New Brand Leadership by Steven O. Kimbrough
Cover of the book InDesign Type by Steven O. Kimbrough
Cover of the book The FT Essential Guide to Writing a Business Plan by Steven O. Kimbrough
Cover of the book Essential C# 4.0 by Steven O. Kimbrough
Cover of the book Blogosphere by Steven O. Kimbrough
Cover of the book Law Express: Family Law by Steven O. Kimbrough
Cover of the book Economics Demystified by Steven O. Kimbrough
Cover of the book Scaling Networks v6 Companion Guide by Steven O. Kimbrough
Cover of the book Pride and Prejudice: York Notes Advanced by Steven O. Kimbrough
Cover of the book Ajax Security by Steven O. Kimbrough
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy