#### Filter Results:

#### Publication Year

2000

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Parrondo's paradox occurs in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. Several variations of Parrondo's games apparently with paradoxical property have been introduced; history dependence, one dimensional line, two… (More)

We introduce a series of generalized clustering coefficients based on String formalism given by Aoyama, using adjacent matrix in networks. We numerically evaluate Milgram condition proposed in order to explore q-th degrees of separation in scale free networks and small world networks. We find that scale free network with exponent 3 just shows 6-degrees of… (More)

- Norihito Toyota
- 2008

In this paper I quantize the stag hunt game in the framework proposed by Marinatto and Weber which, is introduced to quntize the Battle of the Sexes game and gives a general quntization scheme of various game theories. Then I discuss the Nash equibilium solution in the cases of which starting strategies are taken in both non entangled state and entangled… (More)

Braess [1] has been studied about a traffic flow on a diamond type network and found that introducing new edges to the networks always does not achieve the efficiency. Some researchers studied the Braess' paradox in similar type networks by introducing various types of cost functions. But whether such paradox occurs or not is not scarcely studied in complex… (More)

Parrondo's paradox occurs in sequences of games in which a winning expectation value of a payoff may be obtained by playing two games in a random order, even though each game in the sequence may be lost when played individually. Several variations of Parrondo's games apparently with the same paradoxical property have been introduced [5]; history dependence,… (More)

– Parrondo's paradox occurs in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. Several variations of Parrondo's games with paradoxical property have been introduced. In this paper , I examine whether Parrondo's paradox occurs… (More)

Milgram Condition proposed by Aoyama et al. [11] plays an important role on the analysis of " six degrees of separation ". We have shown[16], [17] that the relations between Milgram condition and the generalized clustering coefficient, which was introduced as an index for measuring the number of closed paths by us[6]-[10], are absolutely different in scale… (More)

We reformulated the string formalism given by Aoyama, using an adjacent matrix of a network and introduced a series of generalized clustering coefficients based on it. Furthermore we numerically evaluated Milgram condition proposed by their article in order to explore q-th degrees of separation in scale free networks. In this article, we apply the… (More)

- Norihito Toyota
- 2008

We have proposed two new dynamic networks where two node are swapped each other, and showed that the both networks behave as a small world like in the average path length but can not make any effective discussions on the clustering coefficient because of the topological invariant properties of the networks. In this article we introduce a new index, "… (More)

- Norihito Toyota
- 2008

We have proposed two new evolutionary rules on spatio-iterated games that is not mimic evolution of strategies, and mainly discussed the Prisoner's Dilemma game [10] by the two evoutionary rules [11]. In this paper we focus the first rule, that is, the selfish evolutionary rule for various dilemma games. In contrast to the Prisoner's Dilemma, there are… (More)