Stochastic uncoupled dynamics and Nash equilibrium

In this paper we consider dynamic processes, in repeated games, that are subject to the natural informational restriction of uncoupledness. We study the almost sure convergence of play (the period-by-period behavior as well as the long-run frequency) to Nash equilibria of the one-shot stage game, and present a number of possibility and impossibility results. Basically, we show that if in addition to random experimentation some recall, or memory, is introduced, then successful search procedures that are uncoupled can be devised. In particular, to get almost sure convergence to pure Nash equilibria when these exist, it suffices to recall the last two periods of play.     

Symmetrical design of strategy-pairs for enplaning and deplaning an airplane

Enplaning and deplaning processes are two main activities that passengers experience in an airplane. They are also the main factors contributing to the airplane turn time. Thus, both processes need to be carefully considered when designing a new strategy. The main contribution of this paper is twofold. Firstly, we propose a symmetrical design of deplaning strategies to match three typical grouped enplaning strategies (back-to-front, windows-to-aisle and reverse pyramid), in which the groups are organized in a LIFO (Last In First Out) manner. Secondly, we present an integrated cellular automaton model to describe the dynamic characteristics of passengers in the enplaning and deplaning processes. Numerical evaluation results indicate that the proposed windows-to-aisle and reverse pyramid strategies perform better in the following aspects: (i) the total operation time decreases; (ii) the two strategies are less sensitive to the load condition, e.g., luggage distribution and cabin occupancy rate; (iii) passengers’ satisfaction is enhanced since both individual waiting time and processing time lower down; (iv) the two strategies are fairer for the passengers since the difference among the groups remarkably shrinks.     

格值可逆自动机的代数性质

首先在格值逻辑框架下引入格值自动机的概念,并提出可逆映射的概念,从而诱导出格值可逆自动机的概念;其次研究了格值可逆自动机的代数性质,同时给出保证该代数性质成立的充分必要条件.     

面向港区平面交叉口安全性评价的微观交通仿真模型

本文基于交通冲突技术(TCT),通过建立港区交叉口交通流微观仿真模型,对影响港区交叉口安全性的主要冲突类型进行分析评价。结合港区道路交通特性,仿真模型引入车型参数控制因素,以车辆间冲突制动距离为评价指标,并对大型车辆弯道行驶轨迹及其产生的冲突进行了分析,通过采用改进的二维元胞自动机模型,对车辆在元胞中的加速、减速以及位移规则进行了改进。通过仿真得出,在实验条件下,跟驰冲突是影响平面交叉口安全性的主要冲突类型,侧面冲突是影响交叉口通行能力的主要冲突类型,仿真结果及分析表明了本文交通仿真模型的有效性。     

Evaluation of the effect of investor psychology on an artificial stock market through its degree of efficiency

The main objective of this article is to develop a Cellular Automaton Model in which more than one type of stockbroker interact, and where the use and exchange of information between investors describe the complexity measured through the estimation of the Hurst exponent. This exponent represents an efficient or random market when it has a value equal to 0.5. Thanks to the various proposals, it can be determined in this investigation that a rational component must exist in the simulator in order to generate an efficient behavior.     

基于改进C5.0的元胞自动机模型研究——以土地利用问题为例

元胞自动机模型是通过局部的相互作用及变化来模拟全局的变化,是复杂结构来源于简单系统的重要体现。元胞自动机模型的核心是转换规则的获取,获取转换规则的方法有多种。建立一种基于改进C5.0决策树的元胞自动机模型,基于属性值的相似性对C5.0决策树算法进行改进,以期提高元胞自动机的模拟精度,该模型适用于多种复杂系统的模拟问题研究。最后以土地利用问题为例演示了模型的应用。     

Reducing airplane boarding time by accounting for passengers' individual properties: A simulation based on cellular automaton

The increase of air travel puts tremendous burden on airline companies. A time saving boarding strategy is required to improve the utilization of airplane boarding time and explore flexible time management strategies. Firstly, an improved boarding strategy is introduced by assigning individual passengers to seats based on the number of luggage they carry. Passengers with the most luggage board onto the plane first. To test the behavior of boarding strategies under different conditions, a sophisticated simulation environment based on cellular automata model is designed. Simulation results indicate that the improved boarding strategy shows an excellent efficiency and robustness comparing with other strategies.     

Strategic complexity in repeated extensive games

This paper studies a machine (finite automaton) playing a two-player repeated game of a simple extensive-form game with perfect information. We introduce a new complexity measure called multiple complexity which incorporates a strategyʼs responsiveness to information in the stage game as well as the number of states of the machine. We completely characterize the Nash equilibrium of the machine game. In the sequential-move prisonerʼs dilemma, cooperation can be sustained as an equilibrium.     

构建最小入侵检测特征集的贪心算法

文章通过贪心算法构建入侵检测特征串的最小特征集,并生成基于该最小特征集的确定有限状态自动机(DFA)。实验结果表明:该方法减少入侵检测特征的存储空间40%,提高了基于DFA模式匹配的入侵检测速度,有效提升了入侵检测软硬件系统的性能。