138. On the variational inequality approach to Network Games
Invited abstract in session TC-9: Variational Analysis II, stream Variational analysis: theory and algorithms.
Tuesday, 14:00-16:00Room: B100/8013
Authors (first author is the speaker)
| 1. | Fabio Raciti
|
| Mathematics and Computer Science, University of Catania |
Abstract
Network Games are a class of games where players are identified with the nodes of a graph and the (social or economic) relationships between any two players are represented by arcs of the graph. The interaction between a generic player and their neighbors is thus described by means of the adjacency matrix of the graph and, under suitable assumptions, the Nash equilibrium of the game can be expressed as a power expansion of the adjacency matrix. Since the seminal paper [1], many game theorists have written numerous papers on this topic, but the powerful tool of variational inequalities has not been fully exploited yet, with some exceptions. In the last years, the author, (F.R.) , has carried out a systematic analysis of the variational inequality approach to Network Games from both the theoretical and numerical point of view. In this talk we will describe the methodology above mentioned and some recent results.
[1] C. Ballester, Calvò-Armengil, Y. Zenou: WHO'S WHO IN NETWORKS. WANTED: THE KEY PLAYER, Econometrica, Vol. 74, No. 5 (September, 2006), 1403-1417.
Keywords
- Global optimization
- Linear and nonlinear optimization
Status: accepted
Back to the list of papers