BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260509T222830EDT-139322ga53@132.216.98.100
DTSTAMP:20260510T022830Z
DESCRIPTION: Informs Auctions and Market Design (AMD) Online Seminar Series
 \n\nSpeaker: Professor Asuman Ozdaglar\, Mathworks Professor of Electrical
  Engineering and Computer Science at MIT\n\nAbstract: In many social and e
 conomic settings\, decisions of individuals are affected by the actions of
  their friends\, colleagues\, and peers. Examples include adoption of new 
 products and innovations\, opinion formation and social learning\, public 
 good provision\, financial exchanges and international trade. Network game
 s have emerged as a powerful framework to study these settings with partic
 ular focus on how the underlying patterns of interactions\, governed by a 
 network\, affect the economic outcomes. For tractability reasons\, much of
  the work in this area studied games with special structure (e.g.\, quadra
 tic cost functions\, scalar non-negative strategies) or special properties
  (e.g.\, games of strategic complements or substitutes). In this talk\, we
  first present a unified framework based on a variational inequality refor
 mulation of the Nash equilibrium to study equilibrium properties of networ
 k games including existence and uniqueness\, convergence of the best respo
 nse dynamics and comparative statics. Our framework extends the literature
  in multiple dimensions\, covering games with general strategic interactio
 ns and multidimensional and constrained strategy sets. In the second part 
 of the talk\, we will present a new class of infinite populations games\, 
 graphon games\, that can capture heterogenous local interactions. We will 
 show that equilibria in graphon games can approximate the equilibria of la
 rge network games sampled from the graphon. We also show that (under some 
 regularity assumptions on the graphon)\, interventions based on graphon ga
 mes can be designed using computationally tractable optimization problems 
 and with much less information than the entire network structure.\n\nLink:
  Registration link\n
DTSTART:20210122T180000Z
DTEND:20210122T190000Z
LOCATION:CA\, ZOOM
SUMMARY:Analysis and Interventions in Large Network Games
URL:https://www.mcgill.ca/cim/channels/event/analysis-and-interventions-lar
 ge-network-games-327922
END:VEVENT
END:VCALENDAR