Efficiency of Classical and Quantum Games Equilibria

Nash equilibria and correlated equilibria of classical and quantum games are investigated in the context of their Pareto efficiency. The examples of the prisoner’s dilemma, battle of the sexes and the game of chicken are studied. Correlated equilibria usually improve Nash equilibria of games but require a trusted correlation device susceptible to manipulation. The quantum extension of these games in the Eisert–Wilkens–Lewenstein formalism and the Frąckiewicz–Pykacz parameterization is analyzed. It is shown that the Nash equilibria of these games in quantum mixed Pauli strategies are closer to Pareto optimal results than their classical counter-parts. The relationship of mixed Pauli strategies equilibria and correlated equilibria is also studied.     

Contract Theory-Based Incentive Mechanism for Full Duplex Cooperative NOMA with SWIPT Communication Networks

Cooperative Non-Orthogonal Multiple Access (NOMA) with Simultaneous Wireless Information and Power Transfer (SWIPT) communication can not only effectively improve the spectrum efficiency and energy efficiency of wireless networks but also extend their coverage. An important design issue is to incentivize a full duplex (FD) relaying center user to participate in the cooperative process and achieve a win–win situation for both the base station (BS) and the center user. Some private information of the center users are hidden from the BS in the network. A contract theory-based incentive mechanism under this asymmetric information scenario is applied to incentivize the center user to join the cooperative communication to maximize the BS’s benefit utility and to guarantee the center user’s expected payoff. In this work, we propose a matching theory-based Gale–Shapley algorithm to obtain the optimal strategy with low computation complexity in the multi-user pairing scenario. Simulation results indicate that the network performance of the proposed FD cooperative NOMA and SWIPT communication is much better than the conventional NOMA communication, and the benefit utility of the BS with the stable match strategy is nearly close to the multi-user pairing scenario with complete channel state information (CSI), while the center users get the satisfied expected payoffs.     

Coevolutionary,coexisting learning and teaching agents model for prisoner’s dilemma games enhancing cooperation with assortative heterogeneous networks

Unlike other natural network systems, assortativity can be observed in most human social networks, although it has been reported that a social dilemma situation represented by the prisoner’s dilemma favors dissortativity to enhance cooperation. We established a new coevolutionary model for both agents’ strategy and network topology, where teaching and learning agents coexist. Remarkably, this model enables agents’ enhancing cooperation more than a learners-only model on a time-frozen scale-free network and produces an underlying assortative network with a fair degree of power-law distribution. The model may imply how and why assortative networks are adaptive in human society.     

整治非法煤矿的博弈论分析

通过建立博弈模型,分析事故频发的原因,并提出相应对策．指出设立举报奖金,消除矿工举报的后顾之忧,降低监督成本从而增加监督频率,加大惩罚力度是减少事故的关键．     

人力资本培训投资的博弈分析

针对人力资本组合投资模式仅定性分析职员和企业对人力资本投资行为的特点,应用博弈论进行了相应的定量分析,将贝克尔投资模式与组合投资模式相结合,建立了确定企业投资比率的计算公式,为企业进行人力资本培训投资提供了定量的决策依据。     

白色荧光粉CaF2∶Yb3+/Eu3+/La3+的制备及其上转换发光特性

采用改进的两步高温固相熔融法制备了Yb^3+、Eu^3+、La^3+共掺杂CaF 2的上转换荧光粉。基于荧光猝灭原理,通过改变La^3+掺杂浓度来调节CaF 2∶Yb^3+/Eu^3+材料的发光性能,并在980 nm近红外光激发下,获得了该材料的白色上转换发光(UCL)。在该发光体系中,Yb^3+不仅起到了敏化Eu^3+的作用,同时,Yb^3+二聚体(Yb^3+-dimer)自身合作发出波长范围480~540 nm的绿色荧光。而白光三基色中的绿光正是来自Yb^3+二聚体的合作发光。Eu^3+则作为激活剂,同时发出红色和蓝色荧光。荧光寿命测试结果表明Yb^3+-dimer与Eu^3+之间存在有效的能量传递。值得注意的是,在980 nm激光激发下,1%La^3+掺杂的样品表现出最佳的红、绿、蓝三基色光比列,实现了材料的上转换白光发射,其色度坐标为(0.311,0.340)。     

Phenomenology of nonlocal cellular automata

Dynamical systems with nonlocal connections have potential applications to economic and biological systems. This paper studies the dynamics of nonlocal cellular automata. In particular, all two-state, three-input nonlocal cellular automata are classified according to the dynamical behavior starting from random initial configurations and random wirings, although it is observed that sometimes a rule can have different dynamical behaviors with different wirings. The nonlocal cellular automata rule space is studied using a mean-field parametrization which is ideal for the situation of random wiring. Nonlocal cellular automata can be considered as computers carrying out computation at the level of each component. Their computational abilities are studied from the point of view of whether they contain many basic logical gates. In particular, I ask the question of whether a three-input cellular automaton rule contains the three fundamental logical gates: two-input rules AND and OR, and one-input rule NOT. A particularly interesting edge-of-chaos nonlocal cellular automaton, the rule 184, is studied in detail. It is a system of coupled selectors or multiplexers. It is also part of the Fredkin's gate—a proposed fundamental gate for conservative computations. This rule exhibits irregular fluctuations of density, large coherent structures, and long transient times.     

Random and cooperative sequential adsorption on infinite ladders and strips

We analyze various processes where particles are added irreversibly and sequentially at the sites of infinite ladders or broader strips (i.e., on terraces) of adsorption sites. For sufficiently narrow strips or ladders, exact solution in closed form is possible for a variety of processes. Often this is most naturally achieved by mapping the process onto an equivalent one-dimensional process typically involvingcompetitive adsorption. We demonstrate this procedure for sequential adsorption with nearest-neighbor exclusion on a 2× square ladder. For other select processes on strips slightly too broad for exact solution, almost exact analysis is possible exploiting an empty-site shielding property. In this way, we determine a jamming coverage of 0.91556671 for random sequential adsorption of dimers on a 2× square ladder. For broader strips, we note that the complexity of these problems quickly approaches that for × lattices.     

Quantum Game with Restricted Matrix Strategies

We study a quantum game played by two players with restricted multiple strategies. It is found that in this restricted quantum game Nash equilibrium does not always exist when the initial state is entangled. At the same time,we find that when Nasli equilibrium exists the payoff function is usually different from that in the classical counterpart except in some special cases. This presents an explicit example showing quantum game and classical game may differ.When designing a quantum game with limited strategies, the allowed strategy should be carefully chosen according to the type of initial state.