CS538
Spring 2018
Game Theory in Networks
Instructor: Henry Hexmoor
Time: MWF 1:00pm-1:50pm
Place: Engineering D 131
|
CS538 Spring 2018
|
Last updated: January 16, 2018
Course Description:
Computer and information networks interconnect communities and institutions with various levels leading to many desirable empowerments for populations as well as many perilous epidemics. Few phenomena such as the small worlds effects and the law of the few exemplify paradoxes and foundations of networks in the world. We will examine foundational computational models of human and machine proxy networks. Structures of network formation will be discussed. Quantities and qualities of social and economic networks will be our next focus. Reasoning, migration, diffusion, and games over networks will be our second emphasis area. We will then turn to the phenomena over the Internet and search. Dynamic processes such as percolation will be among our last set of topics.
Objective: The course goes well beyond game theory but includes the basics of it, such as economic networks and social networks. Examples will be built from news like the Arab Spring, the Occupy movement, and the networked scientific, ad hoc working teams.
The course will offer skills to (a) explain natural and collective phenomena in online networks and cyberspace, and (b) understand and design network policies to produce desirable effects.
Lectures in this calss will not cover social network technology development. The term projects could include these activities. The lectures will focus on enabling concepts, models and theories.
Course administration and grading. The course will be run as a regular
lecture class with six home works (10 points each--60 points in all); one in-person, detailed project plan presentation (5 points), Project 1 (15 points), Project 2 (15 points), ten in-class quizzes (0.5 point each-- 10 points in all). Teaming is required for projects.
Who should attend and prerequisites. We welcome advanced CS graduate students with some background in AI and mathematical maturity. Senior undergraduate CS students who have taken CS330 with a grade of C or better are also welcome. A term project is an integral part of this course for all srtudents.
Textbooks:
1. K. Erciyan, 2015. Complex Networks, CRC press.
2. H. Hexmoor, 2014. Computational Network Science: an Algorithmic Approach, Morgan Kaufmann Pub, Elsevier.
Recommended book:
1. D. Easly, J. Kleinberg, 2010. Networks, Crowds, and Markets, Cambridge University press.
2. H. Hexmoor, 2014. Computational Network Science: an Algorithmic Approach, Morgan Kaufmann Pub, Elsevier.
3. M. Jackson, 2008. Social and Economic Nertworks, Princeton University press.
Emergency Procedures: Southern Illinois University Carbondale is committed to providing a safe and healthy environment for study and work. Because some health and safety circumstances are beyond our control, we ask that you become familiar with the SIUC Emergency Response Plan and Building Emergency Response Team (BERT) program. Emergency response information is available on posters in buildings on campus, available on BERT's website at www.bert.siu.edu, Department of Safety's website www.dps.siu.edu (disaster drop down) and in Emergency Response Guideline pamphlet. Know how to respond to each type of emergency.
Useful Links: To find research papers, citeseer and Multiagent.com
Similar Courses: Kleinberg, D'Souza, McCallum, Kearns, CMU, Stanford1, Stanford2, JHU