TWO-PERSON ZERO-SUM GAMES WITH RANDOM PAYOFFS
スポンサーリンク
概要
- 論文の詳細を見る
This paper deals with two-person zero-sum rectangular games with random payoffs. It is assumed that each player knows the distribution functions of the random entries and that players must select their strategies before any observations of the random entries are made. In such a case, several models are considered and relations among the optimal values are obtained. A special case, in which these random entries are linear functions of a random variable is also treated and some properties of the optimal strategies are given. In the final section, illustrative examples are shown.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Kurisu Tadashi
Department Of Applied Physics Faculty Of Engineering Osaka University
-
KURISU TADASHI
Department of Applied Physics, Faculty of Engineering Osaka University
関連論文
- TWO-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS
- TWO-PERSON ZERO-SUM GAMES WITH RANDOM PAYOFFS
- THREE-MACHINE SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS
- TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
- A TWO-VERSUS-ONE SILENT DUEL WITH EQUAL ACCURACY FUNCTIONS UNDER ARBITRARY MOTION
- A TWO-VS.-TWO SILENT DUEL WITH EQUAL ACCURACY FUNCTIONS UNDER ARBITRARY MOTION
- A ONE-NOISY-VERSUS-TWO-SILENT DUEL WITH ARBITRARY ACCURACY FUNCTIONS UNDER ARBITRARY MOTION
- NOISY-VS.-SILENT DUEL WITH ARBITRARY ACCURACY FUNCTIONS UNDER ARBITRARY MOTION