A Game-Theoretical Study of Robust Networked Systems

Free registration required

Executive Summary

This paper analyzes the robustness of networked systems from a game-theoretical perspective. Networked systems often consist of several subsystems sharing resources interdependently based on local preferences. These systems can be modelled by a dependence game, which is a generalisation of stable paths problem. A unique pure Nash equilibrium in a dependence game can characterise the robustness of the represented networked system, precluding oscillations and non-determinism. The authors show that the absence of a structure termed a generalised dispute wheel is useful to ensure the existence of a unique pure Nash equilibrium.

  • Format: PDF
  • Size: 537.2 KB