Evolution of cooperation in spatial traveler's dilemma game

Traveler's dilemma (TD) is one of social dilemmas which has been well studied in the economics community, but it is attracted little attention in the physics community. The TD game is a two-person game. Each player can select an integer value between $R$ and $M$ ($R < M$) as a pure strategy. If both of them select the same value, the payoff to them will be that value. If the players select different values, say $i$ and $j$ ($R \le i < j \le M$), then the payoff to the player who chooses the small value will be $i+R$ and the payoff to the other player will be $i-R$. We term the player who selects a large value as the cooperator, and the one who chooses a small value as the defector. The reason is that if both of them select large values, it will result in a large total payoff. The Nash equilibrium of the TD game is to choose the smallest value $R$. However, in previous behavioral studies, players in TD game typically select values that are much larger than $R$, and the average selected value exhibits an inverse relationship with $R$. To explain such anomalous behavior, in this paper, we study the evolution of cooperation in spatial traveler's dilemma game where the players are located on a square lattice and each player plays TD games with his neighbors. Players in our model can adopt their neighbors' strategies following two standard models of spatial game dynamics. Monte-Carlo simulation is applied to our model, and the results show that the cooperation level of the system, which is proportional to the average value of the strategies, decreases with increasing $R$ until $R$ is greater than the threshold where cooperation vanishes. Our findings indicate that spatial reciprocity promotes the evolution of cooperation in TD game and the spatial TD game model can interpret the anomalous behavior observed in previous behavioral experiments

Acceleration of particles in Einstein-Maxwell-dilaton black holes

It has recently been pointed out that, under certain conditions, the energy of particles accelerated by black holes in the center-of-mass frame can become arbitrarily high. In this paper, we study the collision of two particles in the case of four-dimensional charged nonrotating, extremal charged rotating and near-extremal charged rotating Kaluza-Klein black holes as well as the naked singularity case in Einstein-Maxwell-dilaton theory. We find that the center-of-mass energy for a pair of colliding particles is unlimited at the horizon of charged nonrotating Kaluza-Klein black holes, extremal charged rotating Kaluza-Klein black holes and in the naked singularity case.Comment: 14 page

Role of the porous structure of the bioceramic scaffolds in bone tissue engineering

The porous structure of biomaterials plays a critical role in improving the efficiency of biomaterials in tissue engineering. Here we fabricate successfully porous bioceramics with accurately controlled pore parameters, and investigate the effect of pore parameters on the mechanical property, the cell seeding proliferation and the vascularization of the scaffolds. This study shows that the porosity play an important role on the mechanical property of the scaffolds, which is affected not only by the macropores size, but also by the interconnections of the scaffolds. Larger pores are beneficial for cell growth in scaffolds. In contrast, the interconnections do not affect cell growth much. The interconnections appear to limit the number of blood vessels penatrating through adjacent pores, and both the pores size and interconnections can determine the size of blood vessels. The results may be referenced on the selective design of porous structure of biomaterials to meet the specificity of biological application

FLEET: Butterfly Estimation from a Bipartite Graph Stream

We consider space-efficient single-pass estimation of the number of butterflies, a fundamental bipartite graph motif, from a massive bipartite graph stream where each edge represents a connection between entities in two different partitions. We present a space lower bound for any streaming algorithm that can estimate the number of butterflies accurately, as well as FLEET, a suite of algorithms for accurately estimating the number of butterflies in the graph stream. Estimates returned by the algorithms come with provable guarantees on the approximation error, and experiments show good tradeoffs between the space used and the accuracy of approximation. We also present space-efficient algorithms for estimating the number of butterflies within a sliding window of the most recent elements in the stream. While there is a significant body of work on counting subgraphs such as triangles in a unipartite graph stream, our work seems to be one of the few to tackle the case of bipartite graph streams.Comment: This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyuce and Srikanta Tirthapura. "FLEET: Butterfly Estimation from a Bipartite Graph Stream". The 28th ACM International Conference on Information and Knowledge Managemen