Syllabus ( CSE 512 )
|
|
Basic information
|
|
| Course title: |
Game Theory |
| Course code: |
CSE 512 |
| Lecturer: |
Prof. Dr. Didem GÖZÜPEK
|
| ECTS credits: |
7.5 |
| GTU credits: |
3 (3+0+0) |
| Year, Semester: |
2, Fall and Spring |
| Level of course: |
Second Cycle (Master's) |
| Type of course: |
Area Elective
|
| Language of instruction: |
Turkish
|
| Mode of delivery: |
Face to face
|
| Pre- and co-requisites: |
Computer or Data Networking course |
| Professional practice: |
No |
| Purpose of the course: |
The purpose of this course is to introduce graduate level students to communication networks and to fundamentals of Game Theory. After providing the essentials with an information systems perspective, the course will focus on applications of GT in communication network settings, with a focus on various aspects of data networking, like Network Formation, Internet Pricing, Flow Control, Routing, Medium Access Control, Network Security, Power Control (Wireless) and Spectrum Sharing (Wireless). |
|
|
|
Learning outcomes
|
|
Upon successful completion of this course, students will be able to:
-
Apply the game theory to the field of communication networks
Contribution to Program Outcomes
-
Define and manipulate advanced concepts of Computer Engineering
-
Use advanced knowledge of mathematics, science, and engineering
-
Work effectively in multi-disciplinary research teams
-
Acquire scientific knowledge
-
Design and conduct research projects independently
Method of assessment
-
Written exam
-
Employ game theory in applications of data networks such as network formation, internet pricing, flow control
Contribution to Program Outcomes
-
Define and manipulate advanced concepts of Computer Engineering
-
Formulate and solve advanced engineering problems
-
Review the literature critically pertaining to his/her research projects, and connect the earlier literature to his/her own results
-
Follow, interpret and analyze scientific researches in the field of engineering and use the knowledge in his/her field of study
-
Work effectively in multi-disciplinary research teams
-
Acquire scientific knowledge
-
Design and conduct research projects independently
Method of assessment
-
Written exam
-
Apply game theory in the areas of Medium Access Control, Network Security, Power Control (Wireless) and Spectrum Sharing (Wireless).
Contribution to Program Outcomes
-
Define and manipulate advanced concepts of Computer Engineering
-
Formulate and solve advanced engineering problems
-
Follow, interpret and analyze scientific researches in the field of engineering and use the knowledge in his/her field of study
-
Work effectively in multi-disciplinary research teams
-
Acquire scientific knowledge
-
Find out new methods to improve his/her knowledge.
-
Effectively express his/her research ideas and findings both orally and in writing
Method of assessment
-
Term paper
|
|
Contents
|
|
| Week 1: |
Definition of Game Theory |
| Week 2: |
Static Games of Complete Information – I (Basics) |
| Week 3: |
Static Games of Complete Information – II (Nash Equilibrium) |
| Week 4: |
Static Games of Complete Information – III (Finding Nash Equilibria and Pareto Optimality) |
| Week 5: |
Dynamic Games of Complete Information- I |
| Week 6: |
Dynamic Games of Complete Information - II |
| Week 7: |
Bayesian Games and Games with Special Structure |
| Week 8: |
Midterm exam |
| Week 9: |
Communication Network Fundamentals |
| Week 10: |
Game Theoratic Approaches in Medium Access Control |
| Week 11: |
Game Theoratic Approaches in Routing, Flow Control and Internet Pricing |
| Week 12: |
Game Theoratic Approaches in Network Formation and Network Security |
| Week 13: |
Game Theoratic Approaches in Other Fields of Interest (Topic To be Determined) |
| Week 14: |
Game Theoratic Approaches in Other Fields of Interest (Subject to Student Preferences) |
| Week 15*: |
Game Theoratic Approaches in Other Fields of Interest (Subject to Student Preferences) |
| Week 16*: |
Final exam |
| Textbooks and materials: |
D. Fudenberg and J. Tirole, “Game Theory”, The MIT Press, Cambridge MA, 1992 |
| Recommended readings: |
Siegfried, Tom (2006), A Beautiful Math, Joseph Henry Press, ISBN 0-309-10192-1 |
|
|
* Between 15th and 16th weeks is there a free week for students to prepare for final exam.
|
|
|
|
Assessment
|
|
|
| Method of assessment |
Week number |
Weight (%) |
|
| Mid-terms: |
7 |
30 |
| Other in-term studies: |
|
0 |
| Project: |
10 |
30 |
| Homework: |
|
0 |
| Quiz: |
|
0 |
| Final exam: |
16 |
40 |
| |
Total weight: |
(%) |
|
|
|
Workload
|
|
|
| Activity |
Duration (Hours per week) |
Total number of weeks |
Total hours in term |
|
| Courses (Face-to-face teaching): |
3 |
14 |
|
| Own studies outside class: |
4 |
14 |
|
| Practice, Recitation: |
0 |
0 |
|
| Homework: |
6 |
5 |
|
| Term project: |
10 |
2 |
|
| Term project presentation: |
1 |
1 |
|
| Quiz: |
0 |
0 |
|
| Own study for mid-term exam: |
13 |
1 |
|
| Mid-term: |
1 |
1 |
|
| Personal studies for final exam: |
17 |
1 |
|
| Final exam: |
2 |
1 |
|
| |
|
Total workload: |
|
| |
|
Total ECTS credits: |
* |
|
|
* ECTS credit is calculated by dividing total workload by 25. (1 ECTS = 25 work hours)
|
|
|
-->