© University of Kent - Contact | Feedback | Legal | Cookies
The University of Kent, Canterbury, Kent, CT2 7NZ, T +44 (0)1227 764000
Advanced search
Advanced search uses Google to find a word or phrase in all module descriptions
Games and Networks - CB600
| Location | Term | Level | Credits (ECTS) | Convenor | 2013-14 | 2014-15 | 2015-16 |
|---|---|---|---|---|---|---|---|
| Canterbury | Spring |
Higher
Higher level module taken in stages 2 and 3 of an undergraduate degree
|
15 (7.5) | Nagy Dr G |
|
|
|
The information below applies to the 2013-14 session
Synopsis
This module covers: Combinatorial Optimisation (The Shortest Path Problem, The Minimal Spanning Tree Problem, Flows in Networks, Scheduling Theory, Computational Complexity); Theory of Games (Matrix Games – Pure Strategies, Matrix Games – Mixed Strategies, Bimatrix Games, N-person Games and Multi-Criteria Decision Theory)
Details
This module appears in:
Contact hours
24 lectures, 12 seminars.
Method of assessment
70% 2-hour examination; 30% Coursework (four components)
Preliminary reading
- W.L.Winston (1994) Operations Research: Applications and Algorithms (3rd edn.), ITP-Duxbury Belmont
Learning outcomes
- Develop models of problems in the fields of Combinatorial Optimisation and Game Theory Analyse such models and hence solve problems Present the findings of analyses in a rigorous yet clear fashion Apply problem-solving and numerical skills to solve complex problems
Pre-requisites
Level C module in Mathematics (eg CB314, EC305/306, MA301/303)