Perfect equilibria in stochastic games

We examine stochastic games with finite state and action spaces. For the -discounted case, as well as for the irreducible limiting average case, we show the existence of trembling-hand perfect equilibria and give characterizations of those equilibria. In the final section, we give an example which illustrates that the existence of stationary limiting average equilibria in a nonirreducible stochastic game does not imply the existence of a perfect limiting average equilibrium.Support was provided by the Netherlands Organization for Scientific Research NWO via the Netherlands Foundation for Mathematics SMC, Project 10-64-10.     

Partition function zeros for the one-dimensional ordered plasma in Dirichlet boundary conditions

We consider the grand canonical partition function for the ordered one-dimensional, two-component plasma at fugacity in an applied electric fieldE with Dirichlet boundary conditions. The system has a phase transition from a low-coupling phase with equally spaced particles to a high-coupling phase with particles clustered into dipolar pairs. An exact expression for the partition function is developed. In zero applied field the zeros in the plane occupy the imaginary axis from –i to –i_c and i_c to i for some _c. They also occupy the diamond shape of four straight lines from ±i_c to _c and from ±i_c to –_c. The fugacity acts like a temperature or coupling variable. The symmetry-breaking field is the applied electric fieldE. A finite-size scaling representation for the partition in scaled coupling and scaled electric field is developed. It has standard mean field form. When the scaled coupling is real, the zeros in the scaled field lie on the imaginary axis and pinch the real scaled field axis as the scaled coupling increases. The scaled partition function considered as a function of two complex variables, scaled coupling and scaled field, has zeros on a two-dimensional surface in a domain of four real variables. A numerical discussion of some of the properties of this surface is presented.     

Meyniel's conjecture holds for random d‐regular graphs

In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most . In a separate paper, we showed that Meyniel's conjecture holds asymptotically almost surely for the binomial random graph. The result was obtained by showing that the conjecture holds for a general class of graphs with some specific expansion‐type properties. In this paper, this deterministic result is used to show that the conjecture holds asymptotically almost surely for random d‐regular graphs when d = d(n) ≥ 3.     

利用游戏化教学促进“微粒观”建构*——以“原子的结构”第一课时为例

分析了初中化学微粒观的教学内容和“原子的结构”的相关教学设计,针对学生“微粒观”建构存在的难题,提出利用反馈机制,采用“寓教于乐”的游戏化教学设计,并进行实践效果访谈。不仅完成了本课时的教学目标,也让学生对化学的兴趣更加浓厚。     

Generalized Fourth-Order Decompositions of Imaginary Time Path Integral: Implications of the Harmonic Oscillator

The imaginary time path integral formalism offers a powerful numerical tool for simulating thermodynamic properties of realistic systems. We show that, when second-order and fourth-order decompositions are employed, they share a remarkable unified analytic form for the partition function of the harmonic oscillator. We are then able to obtain the expression of the thermodynamic property and the leading error terms as well. In order to obtain reasonably optimal values of the free parameters in the generalized symmetric fourth-order decomposition scheme, we eliminate the leading error terms to achieve the accuracy of desired order for the thermodynamic property of the harmonic system. Such a strategy leads to an efficient fourth-order decomposition that produces third-order accurate thermodynamic properties for general systems.     

Universal scaling for the dilemma strength in evolutionary games

Why would natural selection favor the prevalence of cooperation within the groups of selfish individuals? A fruitful framework to address this question is evolutionary game theory, the essence of which is captured in the so-called social dilemmas. Such dilemmas have sparked the development of a variety of mathematical approaches to assess the conditions under which cooperation evolves. Furthermore, borrowing from statistical physics and network science, the research of the evolutionary game dynamics has been enriched with phenomena such as pattern formation, equilibrium selection, and self-organization. Numerous advances in understanding the evolution of cooperative behavior over the last few decades have recently been distilled into five reciprocity mechanisms: direct reciprocity, indirect reciprocity, kin selection, group selection, and network reciprocity. However, when social viscosity is introduced into a population via any of the reciprocity mechanisms, the existing scaling parameters for the dilemma strength do not yield a unique answer as to how the evolutionary dynamics should unfold. Motivated by this problem, we review the developments that led to the present state of affairs, highlight the accompanying pitfalls, and propose new universal scaling parameters for the dilemma strength. We prove universality by showing that the conditions for an ESS and the expressions for the internal equilibriums in an infinite, well-mixed population subjected to any of the five reciprocity mechanisms depend only on the new scaling parameters. A similar result is shown to hold for the fixation probability of the different strategies in a finite, well-mixed population. Furthermore, by means of numerical simulations, the same scaling parameters are shown to be effective even if the evolution of cooperation is considered on the spatial networks (with the exception of highly heterogeneous setups). We close the discussion by suggesting promising directions for future research including (i) how to handle the dilemma strength in the context of co-evolution and (ii) where to seek opportunities for applying the game theoretical approach with meaningful impact.     

Partition coefficients of organic molecules in squalane and water/ethanol mixtures by molecular dynamics simulations

Accurate partition coefficient data of migrants between a polymer and a solvent are of paramount importance for estimating the migration of the migrant over time, including the concentration of the migrant at infinite time in the two solvents. In this article it is shown how this partition coefficient can be estimated for both a small hydrophilic and a hydrophobic organic molecules between squalane (used here to mimic low density poly ethylene) and water/ethanol solutes using thermodynamic integration to calculate the free energy of solvation. Molecular dynamics simulations are performed, using the GROMACS software, by slowly decoupling of firstly the electrostatic and then the Lennard-Jones interactions between molecules in the simulation box. These calculations depend very much on the choice of force field. Two force fields have been tested in this work, the TraPPE-UA (united-atom) and the OPLS-AA (all-atom). The computational cheaper TraPPE-UA force field showed to be more accurate over the whole range of systems compared to the OPLS-AA force field. Moreover, some of the calculations were done with five different water models to investigate the influence of the specific water model on the calculations. It was found that the combination of the TraPPE-UA force field and the TIP4p water model gave the best results. Based on the methodology proposed in this article, it is possible to obtain good partition coefficients only knowing the chemical structure of the molecules in the system.