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 NETWORK GAMES
Code COMP558
Coordinator Dr M Gairing
Computer Science
M.Gairing@liverpool.ac.uk
Year CATS Level Semester CATS Value
Session 2016-17 Level 7 FHEQ Second Semester 15

Aims
  • To provide a critical, systematic and in-depth understanding of game theoretic solution concepts as applied to non-cooperative usage of shared networks.

  • To provide a sound foundation concerning the computational complexity of game theoretic solution concepts in various network games.  



  • To provide an overview of the contemporary research issues in selected network games.

  • To provide an understanding of the inefficiency arising from uncontrolled, decentralized usage of networks.
    		•

    Learning Outcomes

    Have a critical awareness of current problems and research issues in network games.

    Ability to describe and explain game theoretic computational models and algorithms.

    Ability to quantify the inefficiency of equilibria.
    Ability read, describe, summarise, and present previous work in the area of algorithmic game theory.

    Ability recognise research opportunities and open problems.


    Syllabus
    1  Reminder of game theory fundamentals (with a focus on networks): non-cooperative game theory, classical game representations, solution concepts such as Nash equilibria, correlated equilibria, and sink equilibria. (5 lectures)

    Compact representations of games: graphical games, congestion games. (3 lectures)

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

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

    Network formation games. (4 lectures)

    Other network relat ed games: e.g. hedonic games, covering games. (4 lectures)

    Evolutionary game theory applied to selfish routing. (4 lectures)


    Teaching and Learning Strategies

    Lecture -

    Tutorial -


    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
    Unseen Written Exam  2 hours  2  75  Yes  Standard UoL penalty applies  Assessment 2 
    CONTINUOUS Duration Timing
    (Semester)    		 % of
    final
    mark    		 Resit/resubmission
    opportunity    		 Penalty for late
    submission    		 Notes
    Coursework  15 hours  2  15  No reassessment opportunity  Non-standard penalty applies  Assessment 1 There is no reassessment opportunity, Non-standard penalty applies for late submission,  
    Coursework  15 hours    10  No reassessment opportunity  Standard UoL penalty applies  Assessment 3 There is no reassessment opportunity, Notes (applying to all assessments) 2 (sets of) assessment tasks Written examination  

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