|Title: ||Θεωρία Παιγνίων|
|Lesson Code: ||321-8001|
|Theory Hours: ||3|
|Lab Hours: |
|Faculty: ||Kaporis Alexios|
Introduction to game theory, definition of equilibrium notions, examples. Pure and mixed Nash equilibriums. Price of anarchy. Non zero sum games. Lemke-Howson's algorithm. The complexity of computing equilibriums and Brower's fixed point. The PPAD class. The PLS class. Approximate equilibriums. Stackelberg strategies. Braess's paradox.
Trying to model the interaction of rational entities, with respect to antagonistic or cooperative nature.
Algorithms and Complexity, Theory of Computation, Combinatorial Optimization, Linear Algebra.
1. Algorithmic Game Theory, T. Roughgarden, E. Tardos, N. Nissan.
Games and Economic Behavior
|Learning Activities and Teaching Methods |
Lectures with slides, use of optimization software as maple, matlab. The lectures are written in videos to help the understanding.
|Assessment/Grading Methods |
|Language of Instruction|
|Greek, English (for Erasmus students)|
|Μode of delivery |