Game of Thrones: Accommodating Monetary Policies in a Monetary Union
Dmitri Blueschke () and
Games, 2018, vol. 9, issue 1, 1-15
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.
Keywords: dynamic game; feedback Nash equilibrium; Pareto solution; monetary union; macroeconomics; public debt; coalitions (search for similar items in EconPapers)
JEL-codes: C C7 C70 C71 C72 C73 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:gam:jgames:v:9:y:2018:i:1:p:9-:d:132430
Access Statistics for this article
Games is currently edited by Prof. Dr. Ulrich Berger
More articles in Games from MDPI, Open Access Journal
Bibliographic data for series maintained by XML Conversion Team ().