Game Theory


The class treats several forms of the notion of Nash equilibrium in a variety of problems from the economic and social sciences.

Objectives

not available

Prerequisites

not available

Syllabus

Game representation. Normal/Strategic form. Extended form. Strategies. Domination and its resolution. Nash equilibrium. Cournot duopoly. Cartels. The commons tragedy. Mixed strategies. Expected utility. Risk aversion. Games with non-concurrent actions. Backward induction. Perfect Nash equilibrium for subgames. Repeated games. Finite and infinite games. Firing strategies. Lenient strategies. The common theorem. Dynamic games. Moral hazard. Incentives theories. Games with incomplete information. Bayes-Nash equilibrium. Mechanism design. Revelation principle. Auctions. Algorithmic Game Theory. Game Theory and Social Networks.

COURSE DETAILS

Level:

Type:

Undergraduate

(A+)

Instructors: Ioannis Refanidis
Department: Applied Informatics
Institution: University of Macedonia
Subject: Computer Science, Information Technology, Telecommunications
Rights: Attribution - ShareAlike CC BY-SA

Visit Course Page

SHARE THIS COURSE
RELATED COURSES

,
Eastern Macedonia and Thrace Institute of Technologie

VASSILIS
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Konstandinos Randos
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Ioannis Chalamanis
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Dimitrios Katevas
Eastern Macedonia and Thrace Institute of Technologie
COMPUTER AND INFORMATICS ENGINEERING

Dimitrios Pogaridis
Eastern Macedonia and Thrace Institute of Technologie
COMPUTER AND INFORMATICS ENGINEERING

espa en
GUnet

© Copyright 2016 - GUnet