Mathematics

Game Theory(MAT343)

Content
Course Code Course Name Semester Theory Practice Lab Credit ECTS
MAT343 Game Theory 5 3 0 0 4 6
Prerequisites
Admission Requirements
Language of Instruction French
Course Type Elective
Course Level Bachelor Degree
Course Instructor(s) Refik Cahit ARKUT refik.arkut@gmail.com (Email)
Assistant
Objective
Content INTRODUCTION TO GAME THEORY
1. Introduction
1.1 Defining Games
1.2 Nash Equilibrium
1.3 Strategic Reasoning
1.4 Best Response and Nash Equilibrium
1.5 Nash Equilibrium of Examples Games
1.6 Dominant Strategies
1.7 Pareto Optimality
2. Mixed-Strategy Nash Equilibrium
2.1 Mixed Strategies and Nash Equilibrium
2.3 Computing Mixed Nash Equilibrium
2.4 Hardness Beyond 2x2 Games
2.6 Examples: Mixed Strategy Nash
3. Alternate Solution Concepts
3.1 Beyond the Nash Equilibrium
3.2 Strictly Dominated Strategies and Iterative Removal
3.3 Maxmin Strategies
3.4 Correlated Equilibrium
4. Extensive-Form Games
4.1 Formalizing Perfect Information Extensive Form Games
4.2 Perfect Information Extensive Form Strategies, BR, NE
4.3 Subgame Perfection
4.4 Backward Induction
4.5 Imperfect Information Extensive Form: Definitions, Strategies
4.6 Mixed and Behavioural Strategies
5. Repeated Games
5.1 Infinitely Repeated Games : Utility
5.2 Stochastic Games
5.3 Learning in Repeated Games
5.4 Equilibria of Infinitly Repeated Games
5.5 Discounted Repeated Games
6. Bayesian Games
6.1 Bayesian Games: Definitions
6.4 Analysing Bayesian Games
6.5 Analysing Bayesian Games: Example
7. Coalitional Games
7.1 Coalitional Game Theory
7.2 Coalitional Game Theory: Definitions
7.3 The Shapley Value
7.4 The Core
Course Learning Outcomes
Teaching and Learning Methods
References
Print the course contents
Weekly Contents
Theory Topics
Week Weekly Contents
Practice Topics
Week Weekly Contents
Assessment System
Contribution to Overall Grade
  Number Contribution
Contribution of in-term studies to overall grade 0 0
Contribution of final exam to overall grade 0 0
Toplam 0 0
In-Term Studies
  Number Contribution
Assignments 0 0
Presentation 0 0
Midterm Examinations (including preparation) 0 0
Project 0 0
Laboratory 0 0
Other Applications 0 0
Quiz 0 0
Term Paper/ Project 0 0
Portfolio Study 0 0
Reports 0 0
Learning Diary 0 0
Thesis/ Project 0 0
Seminar 0 0
Other 0 0
Toplam 0 0
Relation of Proficiency
No Program Learning Outcomes Contribution
1 2 3 4 5
1 understands principles of deductive reasoning; has experience to verify well-foundedness and exactness of mathematical statements in systematic ways;
2 can properly state and use concepts and results of major mathematical interest;
3 masters current computational techniques and algorithms; has a good ability in their use; can identify relevant tools, among those one has learned, suitable to solve a problem and is able to judge whether or not one is in possession of these tools;
4 is able to express one’s mathematical ideas in an organised way both in written and oral forms;
5 understands relations connecting substantial concepts and results; can switch from one viewpoint to another on mathematical objects (pictures, formulae, precise statements, heuristic trials, list of examples,...);
6 has followed individually a guided learning strategy; has pursued steps toward the resolution of unfamiliar problems;
7 has a theoretical and practical knowledge in computer science well adapted for learning a programming language;
8 has investigated the relevance of modeling and using mathematical tools in natural sciences and in the professional life; is conscious about historical development of mathematical notions;
9 has followed introduction to some mathematical or non-mathematical disciplines after one’s proper choice; had experience to learn selected subjects according to one’s proper arrangement;
10 masters French language as well as other foreign languages, to a level sufficient to study or work abroad.
ECTS
Activities Number Period Total Workload
Total Workload 0
Total Workload / 25 0,00
Credits ECTS 0
© Copyright 2016 - IT Office
Scroll to Top