All issues
Volume 21 (1978)
- Issue 4 Pages 457-
- Issue 3 Pages 321-
- Issue 2 Pages 171-
- Issue 1 Pages 1-
Volume 21, Issue 4
Displaying 1-12 of 12 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
1978 Volume 21 Issue 4 Pages Cover10-
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (68K) -
Article type: Appendix
1978 Volume 21 Issue 4 Pages App7-
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (100K) -
Kensaku KikutaArticle type: Article
1978 Volume 21 Issue 4 Pages 457-468
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSAn n-tuple is defined for each n-person monotonic characteristic function game. This n-tuple is an imputation when the sum of the components of it is equal to v(N). On the boundary of the set of all monotonic games, we can obtain a condition for the n-tuple being an imputation. The n-tuple belongs to the core when it is an imputation. If the sum of the components of it exceeds v(N), the kernel of the game consists only of interior points of the imputation set.View full abstractDownload PDF (545K) -
Hiroaki IshiiArticle type: Article
1978 Volume 21 Issue 4 Pages 469-476
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper presents a new algorithm determining the K-th best path without any circuit between two specified vertices in a connected, simple and nonoriented graph. The method presented here is based on the well-known fact that the minimum set of ring sum of several Euler graphs and a special path between two vertices consists of all paths between the vertices. Lastly, an illustrative example is given and the efficiency of the algorithm is estimated approximately.View full abstractDownload PDF (334K) -
Takeshi KawashimaArticle type: Article
1978 Volume 21 Issue 4 Pages 477-485
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSFor Jackson type queueing networks, we consider a mean travelling time for a customer between any two stations in a closed case, or a mean sojourn time for a customer until the system departure once he arrives at each station in an open case, and show that these are given by the solutions of certain linear equations, saying turnaround time equations. These results can be extended to the more general queueing networks introduced by Baskett et al. [1].View full abstractDownload PDF (482K) -
Minoru SakaguchiArticle type: Article
1978 Volume 21 Issue 4 Pages 486-508
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSThis paper explores optimal strategies for the problem of choosing several best from a set of sequentially observed bivariate random variables. For example, a couple of husband and wife to make a plan of recreations during a year, has this problem when deciding which offer (or amount of satisfaction) to accept and which to reject. Each offer on arrival is examined first by husband and, if accepted by him, then secondly by his wife. If she rejects it, the offer is rejected. Therefore the offer is "selected" only when both of husband and wife accept it. We assume that the offers are iid bivariate r.v.'s and at most n can be observed. Each offer on arrival is either selected or rejected; an offer rejected now cannot be selected later on. The objective of husband (wife) is to maximize 1:he expected value of the sum, from his (her) standpoint, of the offers actually selected. For another example, the problem of optimal selection of r secretaries to be employed by two university professors in the same department belongs also to our problem. By using dynamic programming technique we develope the optimal procedure for this non-cooperative, sequential, bilateral game and discuss several simple examples. It is shown that it does not matter to husband (or wife) whether he (or she) decides first or second. It is also shown that it does matter to either side whether it decides first or second, if the number of rejections available to each side is given beforehand.View full abstractDownload PDF (1003K) -
Joseph B. KadaneArticle type: Article
1978 Volume 21 Issue 4 Pages 509-516
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSIn this paper optimal strategies are derived for the choice by several players of a set of sequentially observed random variables. The players are permitted to have any utility functions on the chosen random variables, and any opinion on the joint distribution of the sequence of random variables, provided these utility functions and opinions are known to all palyers. A random variable is chosen if enough players want it to be chosen, in a sense made precise. Exactly r of the n available random vectors must be chosen. Once rejected, a random variable cannot later be selected; once selected, it cannot later be rejected. It is shown that when no costs are assigned to rejection, the optimal strategies can be found by backwards induction and the order in which the players announce their decisions does not matter to any of them and does not influence the outcome, confirming a conjecture of Sakaguchi. This contrasts with the situation in which the number of rejections avaialble to each player is limited, where the order typically does matter.View full abstractDownload PDF (513K) -
Article type: Index
1978 Volume 21 Issue 4 Pages 517-518
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (84K) -
Article type: Bibliography
1978 Volume 21 Issue 4 Pages Misc1-
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (12K) -
Article type: Appendix
1978 Volume 21 Issue 4 Pages App8-
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (138K) -
Article type: Cover
1978 Volume 21 Issue 4 Pages Cover11-
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (43K) -
Article type: Cover
1978 Volume 21 Issue 4 Pages Cover12-
Published: 1978
Released on J-STAGE: June 27, 2017
JOURNAL FREE ACCESSDownload PDF (43K)
- |<
- <
- 1
- >
- >|