The minority game with incomplete strategies

This paper proposes a new model of Incomplete Minority Game (IMG), which features a default hierarchy of rules. This model introduces random bits into players’ individual strategies and is capable of applying the exception rules in the absence of the default one. Analysis of the numerical experiment results indicates that, in comparison with the standard Minority Game (SMG) model, this IMG model expands the maximum ensemble of uncorrelated strategies (MEUS) and excels in the effective strategy set and dynamic evolution of individual strategies, which enhance the overall performance by reaching an approximate ideal status in a shorter time with less memory steps and more stable combination of strategies. This paper also discusses the practical implication of the new IMG model.     

Emergent cooperation amongst competing agents in minority games

We study a variation of the minority game. There are N agents. Each has to choose between one of two alternatives every day, and there is a reward to each member of the smaller group. The agents cannot communicate with each other, but try to guess the choice others will make, based only on the past history of the number of people choosing the two alternatives. We describe a simple probabilistic strategy using which the agents, acting independently, and trying to maximize their individual expected payoff, still achieve a very efficient overall utilization of resources, and the average deviation of the number of happy agents per day from the maximum possible can be made O(N^?), for any ?>0. We also show that a single agent does not expect to gain by not following the strategy.     

蒙汉回五岁健康儿童头发中五种金属元素含量的比较研究

任意选取呼和浩特市区蒙汉回族5岁健康男女儿童196例,取其枕部发根,经处理,用原子吸收光谱法测定其中Zn、Fe、Cu、Mg、Ca的含量,计算平均值,并用多因素方差分析法对测定值进行比较研究,结果发现,蒙汉回族五岁儿童发样中五种元素中每一种元素含量的平均值与民族和性别有关.     

The Kolkata Paise Restaurant problem and resource utilization

We study the dynamics of the “Kolkata Paise Restaurant problem”. The problem is the following: In each period, N agents have to choose between N restaurants. Agents have a common ranking of the restaurants. Restaurants can only serve one customer. When more than one customer arrives at the same restaurant, one customer is chosen at random and is served; the others do not get the service. We first introduce the one-shot versions of the Kolkata Paise Restaurant problem which we call one-shot KPR games. We then study the dynamics of the Kolkata Paise Restaurant problem (which is a repeated game version of any given one shot KPR game) for large N. For statistical analysis, we explore the long time steady state behavior. In many such models with myopic agents we get under-utilization of resources, that is, we get a lower aggregate payoff compared to the social optimum. We study a number of myopic strategies, focusing on the average occupation fraction of restaurants.     

The emergence of leadership in social networks

We study a networked version of the minority game in which agents can choose to follow the choices made by a neighbouring agent in a social network. We show that for a wide variety of networks a leadership structure always emerges, with most agents following the choice made by a few agents. We find a suitable parameterisation which highlights the universal aspects of the behaviour and which also indicates where results depend on the type of social network.     

在托卡马克离子回旋频段波加热中高能离子轨道损失特性

本文研究了在托卡马克ICRH少数离子基波加热中,高能离子的轨道损失特性。给出了离子扩散轨道损失的约束时间,并揭示,由于射频波的作用,捕获离子的扩散轨道损失大为增加,随着离子吸收波功率的增加,此损失呈饱和趋势。     

Diffusion length analysis and measurement in the base region of photodiodes

An experimental technique for determining the minority carrier diffusion length in the base region of SI photodiodes described. Optical arrangement has been suggested, in which the device was operated in the photoconductive mode and its photo-response in the wavelength region near the energy gap is measured. The ratio of incident light intensity to photocurrent is a linear function of reciprocal absorption coefficient the slope of which gives L_n. In addition, a nonlinear least-squares analysis is also used to determine the diffusion length. Furthermore, it has been found that L_n decreases as the absorbed dose of gamma rays increases.     

Physical processes of current gain in InAs bipolar junction transistors

InAs bipolar junction transistors (BJTs), grown by molecular beam epitaxy, are reported with common emitter current gains (β's) as large as 400. The factors affecting the common emitter current gain have been studied by estimating the magnitudes of the base transport factor (α_T) and emitter injection efficiency (γ). This has been accomplished by studying a sequence of InAs BJTs with varying emitter doping densities, N_E. Minority carrier diffusion length in the base (L_B), α_T, and γ have been extracted from measured electrical characteristics. The results of the study of these InAs BJTs are as follows: L_B≈0.4 μm, α_T≈98% and γ ranges from 92% to nearly 100% depending on N_E. This knowledge of the magnitudes of the injection efficiencies suggests when it would be useful to move from the simple BJT structure to the more advanced heterojunction bipolar transistor (HBT) structure. Lower γ BJTs would be improved, however high-γ BJTs would benefit little, by the use of the widegap emitters of HBTs. The method developed here to estimate γ, α_T and L_B is not specific to InAs BJTs, but should be useful for study of BJTs and HBTs in any material system.     

A competitive game whose maximal Nash-equilibrium payoff requires quantum resources for its achievement

While it is known that shared quantum entanglement can offer improved solutions to a number of purely cooperative tasks for groups of remote agents, controversy remains regarding the legitimacy of quantum games in a competitive setting. We construct a competitive game between four players based on the minority game where the maximal Nash-equilibrium payoff when played with the appropriate quantum resource is greater than that obtainable by classical means, assuming a local hidden variable model.     

An evolutionary game theory model of binary opinion formation

A basic characteristic of most opinion models is that people tend to agree or compromise in the opinion interaction, which could be hopefully described by cooperative games in the evolutionary game theory framework. This paper presents game theory methods to model the formation of binary opinions: cooperative games are proposed to model the interaction rules of general people who tend to find an agreement; minority games are proposed to model the behaviors of contrarians; opinion preference is considered by varying the payoff values. The Majority Voter model could be restored from the proposed games. The game theory models show evolutionary results similar to traditional opinion models. Specially, the evolution of opinions with consideration of contrarians is in accordance with the Galam model. Furthermore, influences of evolving rule, network topology and initial distribution of opinions are studied through numerical simulations. Discussions about methods to promote or hinder the consensus state at the best equilibrium point are given.