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 Computational Game Theory and Mechanism Design
Code COMP326
Coordinator Dr G Christodoulou
Computer Science
G.Christodoulou@liverpool.ac.uk
Year CATS Level Semester CATS Value
Session 2019-20 Level 6 FHEQ Second Semester 15

Aims

To provide an understanding of the inefficiency arising from uncontrolled, decentralized resource allocation.

To provide a foundation for modelling various mechanism design problems together with their algorithmic aspects.

To provide the tools and paradigms for the design and analysis of efficient algorithms/mechanisms that are robust in environments that involve interactions of selfish agents.

To review the links and interconnections between algorithms and computational issues with selfish agents.

Learning Outcomes

(LO1) Have a systematic understanding of current problems and important concepts in the field of computational game theory.

(LO2) Ability to quantify the inefficiency of equilibria.

(LO3) The ability to formulate mechanism design models or network games for the purpose of modeling particular applications.

(LO4) The ability to use, describe and explain appropriate algorithmic paradigms and techniques in context of a particular game-theoretic or mechanism design problem.

(S1) Critical Thinking and Problem Solving - Critical Analysis

(S2) Information Skills - Critical Reading

(S3) Numeracy - Computational Skills - Problem Solving

(S4) Critical thinking and problem solving - Creative thinking

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

Syllabus
 

Introduction to Network Games: Reminder of game theory fundamentals (with a focus on network games): solution concepts such as Nash equilibria, correlated equilibria. (2 lectures)

Load balancing games: existence and complexity of equilibria, price of anarchy. (3 lectures)

Routing games (atomic and non-atomic selfish routing): existence and complexity of equilibria, price of anarchy, price of stability. (5 lectures)

Introduction to Mechanism Design: Social Choice, Mechanisms with Money, Dominant Strategies, Characterisations of Incentive Compatible Mechanisms, Bayesian-Nash Implementation.  (4 lectures)

Mechanism Design without Money. (3 lectures)

Combinatorial Auctions (CA): Single-Minded Bidders, Bidding Languages, Iterative Auctions, Winner Determination,  Applications. (4 lectures)

Profit Maximisation in Mechanism Design. (3 lectures)

Online Mechanisms (2 Lectures)

Current Topics in Algorithmic Game Theory (Network Cr eation Games, Sponsored Search Auctions, Price of Anarchy in Auctions) (4 lectures)

Teaching and Learning Strategies

Teaching Method 1 - Lecture
Description: Formal Lectures
Attendance Recorded: Yes

Teaching Method 2 - Tutorial
Description: Tutorials
Attendance Recorded: Not yet decided

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

   10

       40
Timetable (if known)              
Private Study 110
TOTAL HOURS 150

Assessment
EXAM Duration Timing
(Semester)		 % of
final
mark		 Resit/resubmission
opportunity		 Penalty for late
submission		 Notes
Written Exam Standard UoL penalty applies for late submission. This is an anonymous assessment. Assessment Schedule (When) :Semester 2  150 minutes.    80       
CONTINUOUS Duration Timing
(Semester)		 % of
final
mark		 Resit/resubmission
opportunity		 Penalty for late
submission		 Notes
Open Problems. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :Second Semester      10       
Open Problems. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :Second Semester      10       

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