Courses Master Display 2014-2015
Course Description | To PDF | |||||||||||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Course title | Game Theory and Optimisation | |||||||||||||||||||||||||||||||||||||||
Course code | EBC4188 | |||||||||||||||||||||||||||||||||||||||
ECTS credits | 6,5 | |||||||||||||||||||||||||||||||||||||||
Assessment | None | |||||||||||||||||||||||||||||||||||||||
Period |
|
|||||||||||||||||||||||||||||||||||||||
Level | Advanced | |||||||||||||||||||||||||||||||||||||||
Coordinator |
Dries Vermeulen For more information: d.vermeulen@maastrichtuniversity.nl |
|||||||||||||||||||||||||||||||||||||||
Language of instruction | English | |||||||||||||||||||||||||||||||||||||||
Goals |
This course provides a comprehensive overview of optimization techniques such as linear and integer programming, and non-linear programming, with applications in game theory and economics. Students learn optimization techniques from mathematics and operations research, and how to apply them in models from game theory and economic theory.
|
|||||||||||||||||||||||||||||||||||||||
Description |
Topics in optimization include duality theorems in LP, branch and bound and cutting plane algorithms in IP, Kuhn-Tucker conditions for NLP, and algorithms for shortest path problems and flow networks.
Topics in game theory and economics include computation of Nash equilibrium and refinements selfish routing in networks and the price of anarchy, and non-emptiness of the core. |
|||||||||||||||||||||||||||||||||||||||
Literature |
The course will be based on chapters from standard textbooks plus additional readers.
Literature : Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein : Introduction to Algorithms, MIT Press. Hans Peters : Game Theory : A Multi-Leveled Approach, Springer-Verlag. David Luenberger and Yinyu Ye : Linear and Nonlinear Programming. Recommended literature for background reading : Christos H. Papadimitriou and Kenneth Steiglitz : Combinatorial Optimization: Algorithms and Complexity. Laurence A. Wolsey and George L. Nemhauser : Integer and Combinatorial Optimization, John Wiley & Sons. |
|||||||||||||||||||||||||||||||||||||||
Prerequisites |
Only Master students can take this course. Exchange students need to have obtained a BSc degree in Economics, International Business, Econometrics, or a related topic. Familiarity with the basic concepts of optimization and linear programming will be helpful. A solid basis in mathematics and calculus is also recommendable.
|
|||||||||||||||||||||||||||||||||||||||
Teaching methods (indicative; course manual is definitive) | PBL / Lecture | |||||||||||||||||||||||||||||||||||||||
Assessment methods (indicative; course manual is definitive) | Written Exam | |||||||||||||||||||||||||||||||||||||||
Evaluation in previous academic year | For the complete evaluation of this course please click "here" | |||||||||||||||||||||||||||||||||||||||
This course belongs to the following programmes / specialisations |
|