Epistemically stable strategy sets

This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets.Epistemic game theory; epistemic stability; rationalizability; closedness under rational behavior; mutual p-belief.

Social Dilemmas and Cooperation in Complex Networks

In this paper we extend the investigation of cooperation in some classical evolutionary games on populations were the network of interactions among individuals is of the scale-free type. We show that the update rule, the payoff computation and, to some extent the timing of the operations, have a marked influence on the transient dynamics and on the amount of cooperation that can be established at equilibrium. We also study the dynamical behavior of the populations and their evolutionary stability.Comment: 12 pages, 7 figures. to appea

Evolutionary prisoner's dilemma game on hierarchical lattices

An evolutionary prisoner's dilemma (PD) game is studied with players located on a hierarchical structure of layered square lattices. The players can follow two strategies [D (defector) and C (cooperator)] and their income comes from PD games with the ``neighbors.'' The adoption of one of the neighboring strategies is allowed with a probability dependent on the payoff difference. Monte Carlo simulations are performed to study how the measure of cooperation is affected by the number of hierarchical levels (Q) and by the temptation to defect. According to the simulations the highest frequency of cooperation can be observed at the top level if the number of hierarchical levels is low (Q<4). For larger Q, however, the highest frequency of cooperators occurs in the middle layers. The four-level hierarchical structure provides the highest average (total) income for the whole community.Comment: appendix adde

Epistemically stable strategy sets

This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets

Spectral Perturbation and Reconstructability of Complex Networks

In recent years, many network perturbation techniques, such as topological perturbations and service perturbations, were employed to study and improve the robustness of complex networks. However, there is no general way to evaluate the network robustness. In this paper, we propose a new global measure for a network, the reconstructability coefficient {\theta}, defined as the maximum number of eigenvalues that can be removed, subject to the condition that the adjacency matrix can be reconstructed exactly. Our main finding is that a linear scaling law, E[{\theta}]=aN, seems universal, in that it holds for all networks that we have studied.Comment: 9 pages, 10 figure

Chemical fracture and distribution of extreme values

When a corrosive solution reaches the limits of a solid sample, a chemical fracture occurs. An analytical theory for the probability of this chemical fracture is proposed and confirmed by extensive numerical experiments on a two dimensional model. This theory follows from the general probability theory of extreme events given by Gumbel. The analytic law differs from the Weibull law commonly used to describe mechanical failures for brittle materials. However a three parameters fit with the Weibull law gives good results, confirming the empirical value of this kind of analysis.Comment: 7 pages, 5 figures, to appear in Europhysics Letter

The distance upon contact: Determination from roughness profile

The point at which two random rough surfaces make contact takes place at the contact of the highest asperities. The distance upon contact d_0 in the limit of zero load has crucial importance for determination of dispersive forces. Using gold films as an example we demonstrate that for two parallel plates d_0 is a function of the nominal size of the contact area L and give a simple expression for d_0(L) via the surface roughness characteristics. In the case of a sphere of fixed radius R and a plate the scale dependence manifests itself as an additional uncertainty \delta d(L) in the separation, where the scale L is related with the separation d via the effective area of interaction L^2\sim\pi Rd. This uncertainty depends on the roughness of interacting bodies and disappears in the limit L\to \infty.Comment: 5 pages, 4 figures, to be published in PR

Extreme value statistics and return intervals in long-range correlated uniform deviates

We study extremal statistics and return intervals in stationary long-range correlated sequences for which the underlying probability density function is bounded and uniform. The extremal statistics we consider e.g., maximum relative to minimum are such that the reference point from which the maximum is measured is itself a random quantity. We analytically calculate the limiting distributions for independent and identically distributed random variables, and use these as a reference point for correlated cases. The distributions are different from that of the maximum itself i.e., a Weibull distribution, reflecting the fact that the distribution of the reference point either dominates over or convolves with the distribution of the maximum. The functional form of the limiting distributions is unaffected by correlations, although the convergence is slower. We show that our findings can be directly generalized to a wide class of stochastic processes. We also analyze return interval distributions, and compare them to recent conjectures of their functional form

Experimental analysis of lateral impact on planar brittle material

The fragmentation of alumina and glass plates due to lateral impact is studied. A few hundred plates have been fragmented at different impact velocities and the produced fragments are analyzed. The method employed in this work allows one to investigate some geometrical properties of the fragments, besides the traditional size distribution usually studied in former experiments. We found that, although both materials exhibit qualitative similar fragment size distribution function, their geometrical properties appear to be quite different. A schematic model for two-dimensional fragmentation is also presented and its predictions are compared to our experimental results. The comparison suggests that the analysis of the fragments' geometrical properties constitutes a more stringent test of the theoretical models' assumptions than the size distribution

Evolution of Coordination in Social Networks: A Numerical Study

Coordination games are important to explain efficient and desirable social behavior. Here we study these games by extensive numerical simulation on networked social structures using an evolutionary approach. We show that local network effects may promote selection of efficient equilibria in both pure and general coordination games and may explain social polarization. These results are put into perspective with respect to known theoretical results. The main insight we obtain is that clustering, and especially community structure in social networks has a positive role in promoting socially efficient outcomes.Comment: preprint submitted to IJMP