CS 491/CS591 Fall 2011 Exploring Game Theory for a Massively Networked Population Instructor: Henry Hexmoor Time: TR 3:35-4:50 pm Place: Pulliam 112

Last updated: November 8, 2011

Course Description: Game theory is the formal study of strategic reasoning. Game theoretic concepts apply whenever the actions of several agents are interdependent. An agent may be an individual, a group, a firm, or any combination of these. The first part of this course is an introduction to game theory and strategic thinking including dominance, Nash equilibrium, and stability.  In the second part, we will examine how game theoretic concepts can be used in developing reasoning strategies, i.e., algorithms. Algorithmic topics covered will include extensive games, regret minimization, negotiation, auctions, voting, social choice, resource allocation, fictitious play, and mechanism design.  

The confluence of social network analysis and automated collective reasoning among contemporary ubiquitous devices such as smart phones will be explored for humanitarian applications of benefit for massively interconnected populations. An example is emergent discovery of food, shelter, and scarce skills in natural disasters. For class project, students will select application of game theory in an approved setting with quantifiable benefits.

Objective:

• To gain a rich understanding of intersection of game theory, computer science, as well as economic and Social networks.

Lectures in this calss will not cover internet programming, setting up ecommerce sites, or developing web pages. 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 lectrure class with two tests, five home work, and a project (see home works 1-4 below).

• Test 1 (20%): This is a tradition style in-class test on material covered in class.
• Test 2 (20%): This is a take home research assignment.
• Assignments (20%): Two traditional style home works with multiple parts that will be graded.

Project (40%): Each student is responsible to develop a game theoretic formulation for a problem they bring to class. The problem must be small, yet rich enough enough to fit the rubric of a semester timeline. Periodically, there will be in-class status update periods designed to help brain storm the problem. In some cases, the problem might be same topic as the student's graduate product or another class. Project is guided by four assignments (i.e.,, HWs 2-5). Possible ideas to be discussed in class include: 1. Argumentation, 2. Network Games, 3. Addressing social enginnering, 4. Reasoning for disaster response.

• HW 1 (10%): This is a self-sufficient, brief research report on your term project.
• HW 2 (5%): Interim, project presentation (5%): You present your working ideas to class for feedback.
• HW 3 (5%): 3: Final, project presentation (5%): You present your project results to class.
• HW 4 (20%): This is a self-sufficient final research report on your term project that supercedes your inteim report.

Planned Schedule:

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. N. Baron, Game Theory: An Introduction, Wiley Press..

2. Noam Nisan, et. al., 2007. Algorithmic Game Theory, Cambridge University Press.

Other Recommended Sources:

Recommended Books:

1. N. Barron, 2008. Game Theory: An introduction, Wiley.

2. K. Binmore, 2007. Playing for Real, Oxford University Press.

3. J.M. Smith, Evolution and the Theory of Games, Cambridge University Press.

4. Dixit, Skeath, Reiley, Games of Strategy, Norton.

5. P.J. Dutta, 1999. Strategies and Games, MIT Press.

Online APA Manual

Useful Links: To find research papers, citeseer and Multiagent.com

Email: Henry Hexmoor