Module Details
The information contained in this module specification was correct at the time of publication but may be subject to change, either during the session because of unforeseen circumstances, or following review of the module at the end of the session. Queries about the module should be directed to the member of staff with responsibility for the module.
Title INTRODUCTION TO COMPUTATIONAL GAME THEORY
Code COMP323
Coordinator Dr G Christodoulou
Computer Science
G.Christodoulou@liverpool.ac.uk
Year CATS Level Semester CATS Value
Session 2019-20 Level 6 FHEQ First Semester 15

Aims

To introduce the student to the notion of a game, its solutions, concepts, and other basic notions and tools of game theory, and the main applications for which they are appropriate, including electricity trading markets.

To formalize the notion of strategic thinking and rational choice by using the tools of game theory, and to provide insights into using game theory in modeling applications.

To draw the connections between game theory, computer science, and economics, especially emphasizing the computational issues.

To introduce contemporary topics in the intersection of game theory, computer science, and economics.

Learning Outcomes

(LO1) A student will understand the notion of a strategic game and equilibria, and understand the characteristics of main applications of these concepts;

(LO2) Given a real world situation a student should be able to identify its key strategic aspects and based on these be able to connect them to appropriate game theoretic concepts;

(LO3) A student will understand the key connections and interactions between game theory, computer science and economics;

(LO4) A student will understand the impact of game theory on its contemporary applications, and be able to identify the key such application areas;

(S1) Numeracy/computational skills - Problem solving

(S2) Critical thinking and problem solving - Creative thinking

(S3) Numeracy/computational skills - Reason with numbers/mathematical concepts

Syllabus
 

Introduction: Making rational choices: what is a game? strategy, preferences, payoffs; basic solution concepts; non-cooperative versus cooperative games; basic computational issues: finding equilibria and learning in games; typical application areas for game theory (e.g. Google's sponsored search, eBay auctions, electricity trading markets). (4 lectures)

Games with Perfect Information: strategic games (prisoner's dilemma, matching pennies); Nash equilibria: theory and illustrations (Cournot's and Bertrand's models of oligopoly, auctions); information about linear programming; mixed strategy equilibrium; zero-sum games; basic computational issues. (9 lectures)

Extensive Games with Perfect Information: repeated games (prisoner's dilemma); subgame perfect Nash equilibrium; computational issues. (3 lectures)

Mechanism Design: basics; social choice; Vickrey and VCG mechanisms (shortest paths); combinatorial auctions; profit maximization; applica tions in Computer Science. (5 lectures)

Modern Applications of Game Theory: Google's sponsored search; eBay auctions; market equilibria; price of anarchy; prediction markets; reputation systems; electricity trading markets.. (9 lectures)

Teaching and Learning Strategies

Teaching Method 1 - Lecture Description: Teaching Method 2 - Tutorial Description:

Teaching Schedule
  Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other TOTAL
Study Hours 30

   5

       35
Timetable (if known)              
Private Study 115
TOTAL HOURS 150

Assessment
EXAM Duration Timing
(Semester)		 % of
final
mark		 Resit/resubmission
opportunity		 Penalty for late
submission		 Notes
             
CONTINUOUS Duration Timing
(Semester)		 % of
final
mark		 Resit/resubmission
opportunity		 Penalty for late
submission		 Notes
Assessment 1 Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :1st semester  20 hours for all CAs    10       
Assessment 2 Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :1st semester  20 hours for all CAs    10       

Recommended Texts
Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module.