scholarly journals Local Interactions andp-Best Response Set

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
J. Durieu ◽  
P. Solal

We study a local interaction model where agents play a finiten-person game following a perturbed best-response process with inertia. We consider the concept of minimalp-best response set to analyze distributions of actions on the long run. We distinguish between two assumptions made by agents about the matching rule. We show that only actions contained in the minimalp-best response set can be selected provided thatpis sufficiently small. We demonstrate that these predictions are sensitive to the assumptions about the matching rule.

Author(s):  
Dionissios T. Hristopulos ◽  
Andrew Pavlides ◽  
Vasiliki D. Agou ◽  
Panagiota Gkafa

2009 ◽  
Vol 41 (1) ◽  
pp. 154-176 ◽  
Author(s):  
Hsiao-Chi Chen ◽  
Yunshyong Chow

In this paper we explore the impact of imitation rules on players' long-run behaviors in evolutionary prisoner's dilemma games. All players sit sequentially and equally spaced around a circle. Players are assumed to interact only with their neighbors, and to imitate either their successful neighbors and/or themselves or the successful actions taken by their neighbors and/or themselves. In the imitating-successful-player dynamics, full defection is the unique long-run equilibrium as the probability of players' experimentations (or mutations) tend to 0. By contrast, full cooperation could emerge in the long run under the imitating-successful-action dynamics. Moreover, it is discovered that the convergence rate to equilibrium under local interaction could be slower than that under global interaction.


2001 ◽  
Vol 38 (2) ◽  
pp. 301-323 ◽  
Author(s):  
Hsiao-Chi Chen ◽  
Yunshyoung Chow

This paper analyzes players’ long-run behavior in an evolutionary model with time-varying mutations under both uniform and local interaction rules. It is shown that a risk-dominant Nash equilibrium in a 2 × 2 coordination game would emerge as the long-run equilibrium if and only if mutation rates do not decrease to zero too fast under both interaction methods. The convergence rates of the dynamic system under both interaction rules are also derived. We find that the dynamic system with local matching may not converge faster than that with uniform matching.


2020 ◽  
Author(s):  
Dionissios Hristopulos ◽  
Vasiliki Agou ◽  
Andreas Pavlides ◽  
Panagiota Gkafa

<p>We present recent advances related to Stochastic Local Interaction (SLI) models. These probabilistic models capture local correlations by means of suitably constructed precision matrices which are inferred from the available data. SLI models share features with Gaussian Markov random fields, and they can be used to complete spatial and spatiotemporal datasets with missing data.  SLI models are applicable to data sampled on both regular and irregular space-time grids.  The SLI models can also incorporate space-time trend functions. The degree of localization provided by SLI models is determined by means of kernel functions and appropriate bandwidths that adaptively determine local neighborhoods around each point of interest (including points in the sampling set and the map grid). The local neighborhoods lead to sparse precision (inverse covariance) matrices and also to explicit, semi-analytical relations for predictions, which are based on the conditional mean and the conditional variance.</p><p>We focus on a simple SLI model whose parameter set involves amplitude and rigidity coefficients as well as a characteristic length scale. The SLI precision matrix is expressed explicitly in terms of the model parameter and the kernel function. The parameter estimation is based on the method of maximum likelihood estimation (MLE). However, covariance matrix inversion is not required, since the precision matrix is known conditionally on the model parameters. In addition, the calculation of the precision matrix determinant can be efficiently performed computationally given the sparsity of the precision matrix.  Typical values of the sparsity index obtained by analyzing various environmental datasets are less than 1%. </p><p>We discuss the results of SLI predictive performance with both real and simulated data sets. We find that in terms of cross validation measures the performance of the method is similar to ordinary kriging while the computations are faster.  Overall, the SLI model takes advantage of sparse precision matrix structure to reduce the computational memory and time required for the processing of large spatiotemporal datasets.  </p><p><strong> </strong></p><p><strong>References</strong></p><ol><li>D. T. Hristopulos. Stochastic local interaction (SLI) model: Bridging machine learning and geostatistics. Computers and Geosciences, 85(Part B):26–37, December 2015. doi:10.1016/j.cageo.2015.05.018.</li> <li>D. T. Hristopulos and V. D. Agou. Stochastic local interaction model for space-time data. Spatial Statistics, page 100403, 2019. doi:10.1016/j.spasta.2019.100403.</li> <li>D. T. Hristopulos, A. Pavlides, V. D. Agou, P. Gkafa. Stochastic local interaction model for geostatistical analysis of big spatial datasets, 2019. arXiv:2001.02246</li> </ol>


2007 ◽  
Vol 42 (2) ◽  
pp. 291-306 ◽  
Author(s):  
Alessandra Cassar ◽  
Rosella Nicolini

Sign in / Sign up

Export Citation Format

Share Document