Abstract (EN)

The purpose of this chapter is to survey the research area of game theory applied to congestion situations, where a group of autonomous agents, interacting in a discrete system that underlies various types of combinatorial optimization problems, try to coordinate their strategies. The structure of the chapter follows the classification of game theory models into two main classes of interaction situations, namely cooperative and non-cooperative games, with a particular focus to the combinatorial domains related to congestion effects in connection and scheduling problems.