Game of thrones: accommodating monetary policies in a monetary union (Q1651876)

From MaRDI portal





scientific article; zbMATH DE number 6901019
Language Label Description Also known as
default for all languages
No label defined
    English
    Game of thrones: accommodating monetary policies in a monetary union
    scientific article; zbMATH DE number 6901019

      Statements

      Game of thrones: accommodating monetary policies in a monetary union (English)
      0 references
      0 references
      0 references
      0 references
      10 July 2018
      0 references
      Summary: In this paper, we present an application of the dynamic tracking games framework to a monetary union. We use a small stylized nonlinear three-country macroeconomic model of a monetary union to analyze the interactions between fiscal (governments) and monetary (common central bank) policy makers, assuming different objective functions of these decision makers. Using the OPTGAME algorithm, we calculate solutions for several games: a noncooperative solution where each government and the central bank play against each other (a feedback Nash equilibrium solution), a fully-cooperative solution with all players following a joint course of action (a Pareto optimal solution) and three solutions where various coalitions (subsets of the players) play against coalitions of the other players in a noncooperative way. It turns out that the fully-cooperative solution yields the best results, the noncooperative solution fares worst and the coalition games lie in between, with a broad coalition of the fiscally more responsible countries and the central bank against the less thrifty countries coming closest to the Pareto optimum.
      0 references
      dynamic game
      0 references
      feedback Nash equilibrium
      0 references
      Pareto solution
      0 references
      monetary union
      0 references
      macroeconomics
      0 references
      public debt
      0 references
      coalitions
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references