The program aims at studying emerging questions on game theory and applications thereof. Some of the most relevant topics of investigation in game theory revolve around the idea of solution concept for a game, the complexity of its calculation, the ability of agents to learn it, its efficiency, and its nature when the game must satisfy some constraints, such as the ones imposed by an underlying network structure.
The program will include two workshops and one tutorial.
The first workshop will deal with games on networks. In many social and economic settings, decisions of individuals are affected by the actions of their peers. Examples include adoption of new products and innovations, opinion formation, social learning, public good provision, financial exchanges, and international trade. Network games have emerged in the last decade as a powerful framework for analyzing this type of strategic interactions by combining elements of network and game theory. In a network game a player's payoff depends only on the actions of her neighbors. Such a framework is general enough to cover many setups of practical interest. There has been much work in the past couple of years on providing fundamental theoretical tools for the analysis of network games and on studying substantive economic and social questions within this framework. A key concern has been to understand the effect that the underlying pattern of interactions or the network structure have on shaping equilibrium outcomes. Other research focused on analyzing how information propagates over a network and how individuals form beliefs and opinions. Finally a third area of research focused on market and financial interactions within networked environments.
The second workshop will focus on learning and games. Studying learning dynamics in games is a natural starting point in an attempt to understand and predict the behavior of rational agents in interesting situations. Mathematicians, computer scientists and economists recognized the key computational phenomenon of learning in game dynamics and made it an important part of game theory's mathematical repertoire. Our workshop will focus on the connections between learning in games, dynamical systems and optimization theory. Dynamical systems offer a powerful mathematical theory to address questions on learning in games (e.g., do dynamics converge?). There are strong connections between online optimization and game theory. The former can indeed be described as a game where the decision maker is facing the environment. At every period they both make some decisions and this process results in some overall payoff that the player aims to maximize. In a stochastic or adversarial environment agents typically try to predict the frequency of future events and respond optimally to those, which is referred to as regret minimization or calibration.
The tutorial will be dedicated to the interaction between learning and a network structure in games. In particular the following topics will be considered: network games of incomplete information, solution concepts for games on networks, adaptive procedures that converge to these solutions, social learning and speed of convergence of the learning procedures.