信任及其对公共财物两难博弈中合作行为影响

社会两难的行为动机研究认为,害怕和贪婪是人们选择不合作的原因。信任的心理学研究为社会两难的合作行为提供了另一种观点,即害怕被利用的背后实际上体现了博弈者对对方的信任的缺失。鉴于传统社会两难范式存在难以区分信任和合作两个因素的问题,本研究设计了“信任一合作”二阶段模拟实验,通过操作重复信托博弈中的信息反馈,研究虚拟多人信托博弈中初始信任和基于经验的信任对随后的公共财物两难博弈中合作行为的影响,结果发现：（1）初始信任对基于经验的信任的建立具有一定的积极影响,但是它对合作行为的作用远不如随后的基于经验的信任;（2）基于经验的信任水平高的被试在随后的公共财物两难博弈中也表现出较高的合作行为。     

网络游戏成瘾者对成瘾相关线索的注意偏向：一项ERP研究

近年来,网络病态使用的一个子类-网络游戏成瘾已经引起了学术研究的兴趣。本研究采用修正版 Stroop实验范式-Online Game Stroop探讨网络游戏成瘾者的注意偏向过程。结果发现,在网络游戏成瘾组中,网络游戏相关词语与中性词语相比诱发了更高的P200以及P300的振幅,但在正常对照组中未发现相同结果。此线索-反应证实了网络游戏成瘾者对特有的成瘾相关线索的高度敏感化引起的注意偏向可能是其成瘾行为产生和维持的重要基础。     

最后通牒游戏中接收者拒绝行为的情绪义务模型

公平偏好使人们在面对不公平的分配时通常会有所表示,在最后通牒游戏中具体表现为对不公平报价的拒绝,有很多研究把拒绝的原因归结为不公平厌恶和互惠主义等社会偏好,但这并不能解释一些最后通牒变体游戏中的拒绝行为。但这恰恰支持了情绪义务模型。     

On Categorical Equivalences of Commutative BCK-algebras

A commutative BCK-algebra with the relative cancellation property is a commutative BCK-algebra (X;*,0) which satisfies the condition: if a ≤ x, a ≤ y and x * a = y * a, then x = y. Such BCK-algebras form a variety, and the category of these BCK-algebras is categorically equivalent to the category of Abelian ℓ-groups whose objects are pairs (G, G ₀), where G is an Abelian ℓ-group, G ₀ is a subset of the positive cone generating G ⁺ such that if u, v ∈ G ₀, then 0 ∨ (u - v) ∈ G ₀, and morphisms are ℓ-group homomorphisms h: (G, G ₀) → (G′,G′₀) with f(G ₀) ⫅ G′₀. Our methods in particular cases give known categorical equivalences of Cornish for conical BCK-algebras and of Mundici for bounded commutative BCK-algebras (= MV-algebras). This revised version was published online in June 2006 with corrections to the Cover Date.     

Essential unifiers

A substitution δ is less general than a substitution σ if there exists λ such that δ=σλ, which induces a notion of generality in the algebra of substitutions. We propose to look at this well known concept of generality again, and to impose a new quasi ordering on substitutions as a natural result of a stronger notion of the composition of substitutions. This new generality ordering has important consequences for the theory of E-unification (unification in equational theories) and changes the basic notion of the most general unifiers, now called essential unifiers, as well as the unification hierarchy. In particular we show that for idempotent Semigroups (associativity and idempotency), also known as Bands, the set of essential unifiers always exists and is finite.     

A non-finitely based quasi-variety of De Morgan algebras

In this paper we exhibit a non-finitely based, finitely generated quasi-variety of De Morgan algebras and determine the bottom of the lattices of sub-quasi-varieties of Kleene and De Morgan algebras.Supported by Vicerrectoría Académica de la Facultad de Ciencias and by División de Investigación, Sede Bogotá of the Universidad Nacional de Colombia.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko     

Cooperation,Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications

Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as Alternating-time Temporal Logic (ATL). The key insight in ATL is that the path quantifiers of CTL could be replaced by cooperation modalities, of the form , where is a set of agents. The intended interpretation of an ATL formula is that the agents can cooperate to ensure that holds (equivalently, that have a winning strategy for ). In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as group can cooperate to bring about iff it is common knowledge in that . The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems.     

Dostoevsky’s enigmas: An analysis of violent men

For the calculating male adult criminal, violent acts would appear largely counterproductive. Scholarly disagreements about these behaviors are substantial, although recent ethnographic reports emphasize the subjective sense of the experience. These reports have an existential aspect, focusing on the meaning of violent, anarchic acts to the identities of perpetrators. The earliest and best known existentialist writer on criminality is Fyodor Dostoevsky whose violent characters Smerdiakov, Svidrigailov, and Stavrogin, are enigmas to their fictional counterparts, much as violent American contemporaries are to authorities and the general public. Dostoevsky’s three enigmatic characters are reckless publicity seekers; like aliens in their own land, they habitually deceive, intimidate, and exploit while still considering themselves to be decent individuals. These depictions are congruent with Yochelson and Samenow’s much more recent forensic observations and reinforce an antisocial prototype. Bogg (1994) offers a behavioral communality for this class of violent men: patterns of self-aggrandizing gaming developed in childhood. The game player derives extraordinary pleasure from victories, although this orientation effectively counters socialization. From Dostoevsky’s views an existential nihilistic construct can be derived. This construct depicts the persona of an inveterate violent game player and is consistent with Durkheimian theory and with ethnographic and forensic/clinical observations. The prevention of a gaming orientation is feasible but appears to require parental skills and community resources.     

Unequal but not separate: Emergence of rich–poor cooperation in resource exchange

Addressing inequality is a critical challenge for society as a whole and requires sustained efforts to promote fairness and opportunity for all. Filling in the resource gap across social classes is essential in reducing inequality. Previous studies have revealed that ingroup favouritism hinders the rich from cooperating with the poor and expands the wealth gap. Nevertheless, how to find ways of narrowing the gap between the rich and the poor remains an open question. Inducing rich–poor cooperation could be effective in eliciting resource flow across classes. In this study, two experiments using a modified Prisoner's Dilemma game were conducted in Japan (N = 213) and China (N = 150) to examine whether highlighting partners' cooperativeness under permeable group boundaries induces rich–poor cooperation. All participants were allocated to the rich group and participated in the game with programmed rich- or poor-group partner bots, whose cooperation rates were manipulated. Despite the initial resource disparities between participants and the partner bots, participants were more likely to select and cooperate with cooperative poor-group partners than with non-cooperative rich-group partners. Generalized trust played an important role in the enhancement of rich–poor cooperation. The findings shed light on the possibility of reducing inequality and promoting social mobility in society.