2017 ◽  
Vol 23 (07) ◽  
pp. 2573-2596 ◽  
Author(s):  
Maurizio Iacopetta

This paper studies the role of liquidity in triggering the emergence of money in a Kiyotaki-Wright economy. A novel method computes the dynamic Nash equilibria of the economy by setting up an iteration of the agents' profile of (pure) strategies and of the distribution of commodities across agents. The analysis shows that the evolving state of liquidity can spark the acceptance of a high-cost-storage commodity as money or cause the disappearance of a commodity money. It also reveals the existence of multiple dynamic equilibria with pure strategies. Several simulations clarify how history and the coordination of beliefs matter for the selection of a particular equilibrium.


2003 ◽  
Vol 55 (3) ◽  
pp. 311-317 ◽  
Author(s):  
Abderrahmane Ziad

Author(s):  
Michail Fasoulakis ◽  
Evangelos Markakis

We focus on the problem of computing approximate Nash equilibria in bimatrix games. In particular, we consider the notion of approximate well-supported equilibria, which is one of the standard approaches for approximating equilibria. It is already known that one can compute an ε-well-supported Nash equilibrium in time nO (log n/ε2), for any ε > 0, in games with n pure strategies per player. Such a running time is referred to as quasi-polynomial. Regarding faster algorithms, it has remained an open problem for many years if we can have better running times for small values of the approximation parameter, and it is only known that we can compute in polynomial-time a 0.6528-well-supported Nash equilibrium. In this paper, we investigate further this question and propose a much better quasi-polynomial time algorithm that computes a (1/2 + ε)-well-supported Nash equilibrium in time nO(log logn1/ε/ε2), for any ε > 0. Our algorithm is based on appropriately combining sampling arguments, support enumeration, and solutions to systems of linear inequalities.


Author(s):  
Peter Wikman

AbstractA product set of pure strategies is a Nash block if it contains all best replies to the Nash equilibria of the game in which the players are restricted to the strategies in the block. This defines an intermediate block property, between curb (Basu and Weibull, Econ Lett 36(2):141–146, 10.1016/0165-1765(91)90179-O, http://www.sciencedirect.com/science/article/pii/016517659190179O, 1991) and coarse tenability (Myerson and Weibull (2015) Econometrica 83(3):943–976, 10.3982/ECTA11048). While the new concept is defined without reference to the consideration-set framework that defines tenability, the framework can be used to characterize Nash blocks in terms of potential conventions when large populations of individuals recurrently interact. Although weaker than curb, Nash blocks nevertheless maintain several robustness properties of curb sets. For example, every Nash block contains an essential component and is robust against payoff perturbations.


2017 ◽  
Vol 2017 ◽  
pp. 1-7
Author(s):  
Ikjyot Singh Kohli ◽  
Michael C. Haslam

We analyze, using a dynamical systems approach, the replicator dynamics for the asymmetric Hawk-Dove game in which there is a set of four pure strategies with arbitrary payoffs. We give a full account of the equilibrium points and their stability and derive the Nash equilibria. We also give a detailed account of the local bifurcations that the system exhibits based on choices of the typical Hawk-Dove parameters v and c. We also give details on the connections between the results found in this work and those of the standard two-strategy Hawk-Dove game. We conclude the paper with some examples of numerical simulations that further illustrate some global behaviours of the system.


Author(s):  
Veronika Grimm ◽  
Daniel Nowak ◽  
Lars Schewe ◽  
Martin Schmidt ◽  
Alexandra Schwartz ◽  
...  

AbstractWhile single-level Nash equilibrium problems are quite well understood nowadays, less is known about multi-leader multi-follower games. However, these have important applications, e.g., in the analysis of electricity and gas markets, where often a limited number of firms interacts on various subsequent markets. In this paper, we consider a special class of two-level multi-leader multi-follower games that can be applied, e.g., to model strategic booking decisions in the European entry-exit gas market. For this nontrivial class of games, we develop a solution algorithm that is able to compute the complete set of Nash equilibria instead of just individual solutions or a bigger set of stationary points. Additionally, we prove that for this class of games, the solution set is finite and provide examples for instances without any Nash equilibria in pure strategies. We apply the algorithm to a case study in which we compute strategic booking and nomination decisions in a model of the European entry-exit gas market system. Finally, we use our algorithm to provide a publicly available test library for the considered class of multi-leader multi-follower games. This library contains problem instances with different economic and mathematical properties so that other researchers in the field can test and benchmark newly developed methods for this challenging class of problems.


2011 ◽  
pp. 65-87 ◽  
Author(s):  
A. Rubinstein

The article considers some aspects of the patronized goods theory with respect to efficient and inefficient equilibria. The author analyzes specific features of patronized goods as well as their connection with market failures, and conjectures that they are related to the emergence of Pareto-inefficient Nash equilibria. The key problem is the analysis of the opportunities for transforming inefficient Nash equilibrium into Pareto-optimal Nash equilibrium for patronized goods by modifying the institutional environment. The paper analyzes social motivation for institutional modernization and equilibrium conditions in the generalized Wicksell-Lindahl model for patronized goods. The author also considers some applications of patronized goods theory to social policy issues.


2020 ◽  
Vol 81 (11) ◽  
pp. 2108-2131
Author(s):  
V. I. Zhukovskiy ◽  
A. S. Gorbatov ◽  
K. N. Kudryavtsev

Sign in / Sign up

Export Citation Format

Share Document