Game Theory
| Course name | Game Theory | Code | CS2105O3 |
| Class | Undergraduate, 2008 - 2011 | Package | 1 | ||||
| Level | Licenţă | Year | 2 | Semester | 1 | Status | Optional |
| Hours per week | Total hours per semester | Total hours of individual work | Credits | Evaluation type | Teaching language | |||
| C | S | L | Pr | |||||
| 2 | 0 | 2 | 0 | 56 | 94 | 5 | E | ro |
| Taught by | Academic and scientific title, name |
|
Associate Professor, PhD,
Rodica Brânzei
|
| Required courses |
| Objectives | This course is intended to provide a general insight in the field of game theory that deals with mathematical models for competition and cooperation. Game theory has applications in economics, social sciences, computer science, etc. The course is mainly aimed to enlighten interaction between game theory and computer science. This course is a must for students interested in Master and PhD programs and scientific research concerning (the interface between informatics and) game theory. |
| General thematics | Introduction to game theory and its applications. Rational choice theory, attitudes towards risk, representation of information and uncertainty. Games in normal form, extensive form and characteristic function form. Special classes of non-cooperative games and cooperative games. Basic solution concepts for non-cooperative and cooperative games and related algorithms. Information and game theory: complete information versus incomplete information; perferct information versus imperfect information; static games versus dynamic games under different scenarios regarding information. Multi-choice games and cooperative games with fuzzy coalitions. Interaction between game theory and computer science. |
| Seminary / Laboratory thematics | Representing a broad range of real-life situations and parlor games as non-cooperative or cooperative games. Solving different non-cooperative and cooperative games using traditional methods and available software. Analysing the complexity of algorihms for computing solutions of games. Designing algorithms for computing solutions of special classes of cooperative games. |
| Teaching methods | Using overhead projector and blackboard. |
| Bibliography |
|
| Evaluation | conditions | |
| criterias | ||
| modes | P (scores for participation during teaching process and for solving homework exercises) and E (scores for written test exam) | |
| formula | 50% P + 50% E |
A. I. Cuza University of Iaşi