# All Data

Id (<span class="translation_missing" title="translation missing: en.view.desc">Desc</span>)

Bulletin of the Faculty of Education, Yamaguchi University Volume 72

published_at 2023-01-31

Publishers : Faculty of Education, Yamaguchi University
Updated At : 2023-01-27 13:09:18

IEEE Access Volume 11
pp. 5062 - 5068

published_at 2023-01-10

Imitation is simple behavior which uses successful actions of others in order to deal with one’s own problems. Because success of imitation generally depends on whether profit of an imitating agent coincides with those of other agents or not, game theory is suitable for specifying situations where imitation can be successful. One of the concepts describing successfulness of imitation in repeated two-player symmetric games is unbeatability. For infinitely repeated two-player symmetric games, a necessary and sufficient condition for some imitation strategy to be unbeatable was specified. However, situations where imitation can be unbeatable in multi-player games are still not clear. In order to analyze successfulness of imitation in multi-player situations, here we introduce a class of totally symmetric games called unexploitable games, which is a natural extension of two-player symmetric games without exploitation cycles. We then prove that, for infinitely repeated unexploitable games, there exist unbeatable imitation strategies. Furthermore, we also prove that, for infinitely repeated non-trivial unexploitable games, there exist unbeatable zero-determinant strategies, which unilaterally enforce some relationships on payoffs of players. These claims are demonstrated in the public goods game, which is the simplest unexploitable game. These results show that there are situations where imitation is unbeatable even in multi-player games.

Creators : Ueda Masahiko
Publishers : IEEE
Updated At : 2023-01-25 14:24:23

村上春樹とアダプテーション研究 Volume 1
pp. 88 - 88

published_at 2023-01-31

Creators : Yamane Yumie
Publishers : 村上春樹とアダプテーション研究会
Updated At : 2023-01-20 15:25:30

村上春樹とアダプテーション研究 Volume 1
pp. 84 - 87

published_at 2023-01-31

Creators : 阿部 翔太
Publishers : 村上春樹とアダプテーション研究会
Updated At : 2023-01-20 15:21:10

村上春樹とアダプテーション研究 Volume 1
pp. 80 - 83

published_at 2023-01-31

Creators : ダルミ カタリン
Publishers : 村上春樹とアダプテーション研究会
Updated At : 2023-01-20 14:55:47

村上春樹とアダプテーション研究 Volume 1
pp. 77 - 79

published_at 2023-01-31

Creators : 内田 康
Publishers : 村上春樹とアダプテーション研究会
Updated At : 2023-01-20 14:30:19

村上春樹とアダプテーション研究 Volume 1
pp. 67 - 76

published_at 2023-01-31

Creators : 跡上 史郎
Publishers : 村上春樹とアダプテーション研究会
Updated At : 2023-01-20 14:17:49

村上春樹とアダプテーション研究 Volume 1
pp. 63 - 66

published_at 2023-01-31

Creators : 藤城 孝輔
Publishers : 村上春樹とアダプテーション研究会
Updated At : 2023-01-20 13:45:09

村上春樹とアダプテーション研究 Volume 1
pp. 52 - 62

published_at 2023-01-31

Creators : Yamane Yumie
Publishers : 村上春樹とアダプテーション研究会
Updated At : 2023-01-20 13:28:49

村上春樹とアダプテーション研究 Volume 1
pp. 38 - 51

published_at 2023-01-31

Creators : 伊藤 弘了
Publishers : 村上春樹とアダプテーション研究会
Updated At : 2023-01-20 13:09:04

村上春樹とアダプテーション研究 Volume 1
pp. 22 - 37

published_at 2023-01-31

Creators : 内田 康
Publishers : 村上春樹とアダプテーション研究会
Updated At : 2023-01-20 10:54:32

村上春樹とアダプテーション研究 Volume 1
pp. 4 - 21

published_at 2023-01-31

Creators : Yamane Yumie
Publishers : 村上春樹とアダプテーション研究会
Updated At : 2023-01-20 10:32:25

村上春樹とアダプテーション研究 Volume 1
pp. 3 - 3

published_at 2023-01-31

Creators : Yamane Yumie
Publishers : 村上春樹とアダプテーション研究会
Updated At : 2023-01-19 16:52:05

Applied Mathematics and Computation Volume 444
pp. 127819 -

published_at 2023-03-01

We investigate symmetric equilibria of mutual reinforcement learning when both players alternately learn the optimal memory-two strategies against the oppo-nent in the repeated prisoners' dilemma game. We provide a necessary condi-tion for memory-two deterministic strategies to form symmetric equilibria. We then provide three examples of memory-two deterministic strategies which form symmetric mutual reinforcement learning equilibria. We also prove that mu-tual reinforcement learning equilibria formed by memory-two strategies are also mutual reinforcement learning equilibria when both players use reinforcement learning of memory-n strategies with n > 2.

Creators : Ueda Masahiko
Publishers : Elsevier
Updated At : 2023-01-17 15:31:40

Memoirs of the faculty of engineering, Yamaguchi university Volume 73 Issue 1
pp. 1 - 9

published_at 2022-12

The Japanese Bridge Management System (J-BMS) RC version consists of the following three subsystems: (1) a bridge maintenance database system (J-BMS DB), (2) a concrete bridge rating expert system (RC-BREX) and (3) a maintenance plan optimization system (MPOS). Especially, in this paper, the RC-BREX system for deteriorating concrete bridges is described based on how to construct from a hierarchical neural network in order to carry out fuzzy inference and machine learning by using the neural network with the back-propagation method. Furthermore, the comparisons between diagnostic results by bridge experts and those of the proposed system are presented so as to demonstrate the validity of the system’s learning capability by using the training set for machine learning which obtained from inspection on actual in-service bridges and questionnaire surveys by bridge experts.

Creators : Miyamoto Ayaho
Publishers : 山口大学工学部
Updated At : 2023-01-10 14:02:17

Yamaguchi journal of economics, business administrations & laws Volume 71 Issue 1-2
pp. 67 - 104

published_at 2022-07-31

Taiwan has not yet been singed the “Convention on Nuclear Safety; CNS” that was adopted by the International Atomic Energy Agency （IAEA） in 1994. However, if these international activities help promote nuclear safety, Taiwan must participate in it and fulfill its related obligations. Therefore, despite Taiwan being a non-member state to the CNS, it is required by the Convention to act as a member state to meet all the requirements addressed in the CNS. Ensuring the public trust of nuclear safety regulations in the most important policy issue for the location, operation, waste disposal and off-commissioning of nuclear power plants, etc. As part of an international comparison of nuclear safety regulatory bodies in the East Asian region, this note organizes and evaluates the independence and transparency of Taiwan’s regulatory bodies.

Creators : Chen Li-chun
Publishers : The Economic Society of Yamaguchi University
Updated At : 2022-12-14 15:29:23

Yamaguchi journal of economics, business administrations & laws Volume 71 Issue 1-2
pp. 45 - 66

published_at 2022-07-31

Creators : Yanagisawa Noboru
Publishers : The Economic Society of Yamaguchi University
Updated At : 2022-12-14 15:15:00

Yamaguchi journal of economics, business administrations & laws Volume 71 Issue 1-2
pp. 21 - 43

published_at 2022-07-31

Creators : Yashiro Taku
Publishers : The Economic Society of Yamaguchi University
Updated At : 2022-12-14 14:36:03

Yamaguchi journal of economics, business administrations & laws Volume 71 Issue 1-2
pp. 1 - 19

published_at 2022-07-31

The purpose of this paper is to present a macroeconomic model, in which the bank determine the loan interest rate and the deposit interest rate by assuming the loan demand curve and the deposit supply curve. The bank adjusts the loan interest rate and the deposit interest rate while observing the difference between the assumed demand for loan and the actual demand for loan.

Creators : Umada Tetsuji
Publishers : The Economic Society of Yamaguchi University
Updated At : 2022-12-14 13:37:17

published_at 2022-11

Some textbooks of formal languages and automata theory implicitly state the structural equality of the binary n-dimensional de Bruijn graph and the state diagram of minimum state deterministic finite automaton which accepts regular language (0+1)*1(0+1)^{n-1}. Although the isomorphism in binary case is relatively easy to prove, it is desirable to rigorously prove such an isomorphism in general k-ary case. To achieve this purpose, the author introduces a new computational model, called "colored finite automata (CFA)," and give a certain characterization of the general k-ary de Bruijn graphs by regular languages.
The second purpose of this study is to investigate the potential of this automaton with multi-colored accepting states. By the way, when CFA is nondeterministic (NCFA), it is desirable that the colors of accepting states are unmixed (i.e., there are no inputs that are accepted with differently colored accepting states) in order to pursuit the accurate identification. Thus, the author proposes the three decision problems (Unmixedness Verification problem, Unmixedness Partitioning problem, and Unmixedness Extension problem) concerning unmixedness and show that UV, UP, and UE problems are shown to be NLOG-complete, P, and NP-complete, respectively. The author also illustrates the applications of colored finite automata, e.g. to existing regular expression engines and model checking tools for the purpose of improvement of their efficiency and conveniency.
Next, the author introduces "colored pushdown automaton (CPDA)" which is an ordinary pushdown automaton with colored accepting states. It is shown that while the computational complexity of the above-mentioned UV, UP, and UE problems of CPDA are all undecidable, restriction of CPDA are all undecidable, restriction of CPDAs to unambiguous ones simplifies some problems of them to the permanently true problems.
In this way, the concept of colored accepting states can be applied to a wide range of automata that have a set of accepting states and expected to be useful in a wide range of theoretical and practical field of automata applications in the future.

Creators : 高橋 芳明
Updated At : 2022-12-09 15:48:58

Bulletin of the Integrated Center for Education Research and Training Volume 54
pp. 193 - 199

published_at 2022-08-15

Creators : Miyaki Hideo | Matsumura Kae | Suto Kunihiko | Matsuoka Katsuhiko
Publishers : 山口大学教育学部附属教育実践総合センター
Updated At : 2022-12-09 11:25:12

Bulletin of the Integrated Center for Education Research and Training Volume 54
pp. 183 - 191

published_at 2022-08-15

Creators : Matsumura Yu | Hiratsuka Asahi | Saiki Hideto
Publishers : 山口大学教育学部附属教育実践総合センター
Updated At : 2022-12-09 10:48:37

Bulletin of the Integrated Center for Education Research and Training Volume 54
pp. 173 - 181

published_at 2022-08-15

Creators : Tanaka Satoshi | Saiki Hideto
Publishers : 山口大学教育学部附属教育実践総合センター
Updated At : 2022-12-09 10:33:01

Bulletin of the Integrated Center for Education Research and Training Volume 54
pp. 165 - 172

published_at 2022-08-15

Creators : Kobayashi Hironori | Mizuno Koki | Saiki Hideto
Publishers : 山口大学教育学部附属教育実践総合センター
Updated At : 2022-12-09 10:22:04

Bulletin of the Integrated Center for Education Research and Training Volume 54
pp. 155 - 163

published_at 2022-08-15

Creators : Kiya Hidekatsu
Publishers : 山口大学教育学部附属教育実践総合センター
Updated At : 2022-12-09 10:15:23