GAME THEORY

Second cycle degree in COMPUTER ENGINEERING

Campus: PADOVA

Language: English

Teaching period: First Semester

Lecturer: LEONARDO BADIA

Number of ECTS credits allocated: 6


Syllabus
Prerequisites: A course, even a basic one, on statistics.
Examination methods: Preliminary written exam (general exercises on the course).
Development of a project in 1-3 person groups, on course-related topics but applied to ICT, and discussion of it (by appointment).
Course unit contents: Basic concepts of game theory
Utility, market, discount factor
Static games in normal form
Dominance, Nash equilibrium
Efficiency, price of anarchy
Zero-sum games, minmax games
Mixed strategies, mixed equilibria
Nash theorem, minmax theorem
Pure and mixed strategies
The tragedy of the commons

Dynamic games
Strategy and subgames
Backward utility
Stackelberg equilibria
Repeated games and cooperation
Dynamic duopolies, collusion
Cooperation, pricing
Imperfect/incomplete information
Bayesian games, signaling, beliefs
Revelation principle

Axiomatic game theory
Fictitious play
Best response dynamics
Distributed optimization
Algorithmic game theory
Computation, complexity, and completeness of equilibria
Auctions, bargaining
First-price and second-price auctions
VCG principle
Cooperative games: the core, the Shapley value

Duopolies and competition
Resource allocation
Utilities, choices, and paradoxes
Potential games, coordination
Bio-inspired algorithms
Evolutionary games
Cognitive networks
Selfish routing
Game-theory enabled multiple-input systems
Wireless spectrum auctions