Skip to content

平成23年度 秋期 ITパスポート試験 問24

This question's explanation and your answers so far.

問24
頻出度★★★

A社と競合B社の相互の意思決定において,A社先手で相互に3手目までの打つ手を次の表のとおり作成した。表の数値は3手目の局面におけるA社の期待値である。A社は自社の期待値を大きくするように打つ手を選択し,B社は,3手目の結果を予測してA社の期待値を小さくするように打つ手を選択するとき,3手目の局面におけるA社の期待値は何億円か。 単位 億円

1手目:A社2手目:B社3手目:A社3手目の局面におけるA社の期待値
値引きする値引きする広告する9
広告しない2
値引きしない広告する15
広告しない8
値引きしない値引きする広告する0
広告しない−6
値引きしない広告する10
広告しない4
出典 平成23年度 秋期 ITパスポート試験 問24
解説

問 24

  • Incorrectア

    8 hundred million yen is the value of the cell for 1st move = cut price, 2nd move = do not cut price, 3rd move = do not advertise. However, the 3rd move on this branch is Company A's turn, and Company A chooses so as to make its own expected value larger, so it takes the 15 of Advertise on the same branch. 8 is an option that Company A itself throws away, so it never comes about in the first place. This is the mistake you fall into if you are conscious only of Company B minimizing and end up taking the smaller value at Company A's turn as well.

  • イ

    正解 The correct answer is イ (9 hundred million yen). This question expresses the situation in which the two sides choose moves alternately as a tree structure (a decision tree) and is solved by backward induction, fixing the value of each position by working back from the last move. Company A chooses the move that makes its expected value larger and Company B chooses the move that makes it smaller, so we take the maximum at positions where Company A moves and the minimum at positions where Company B moves, going back up toward the root. First, evaluate the 3rd move (Company A's turn, maximize). On the branch 1st move = cut price, 2nd move = cut price, the values are Advertise 9 and Do not advertise 2, so 9. On the branch 1st move = cut price, 2nd move = do not cut price, they are 15 and 8, so 15. On the branch 1st move = do not cut price, 2nd move = cut price, they are 0 and −6, so 0. On the branch 1st move = do not cut price, 2nd move = do not cut price, they are 10 and 4, so 10. Next, evaluate the 2nd move (Company B's turn, minimize). If Company A chose to cut price on the 1st move, Company B's options are 9 and 15, so Company B aims for the smaller one and chooses to cut price, and the value of this position is fixed at 9. If Company A chose not to cut price on the 1st move, Company B's options are 0 and 10, so Company B chooses to cut price, and the value of this position is fixed at 0. Finally, evaluating the 1st move (Company A's turn, maximize), Company A can choose between 9 and 0, so Company A chooses to cut price and obtains 9. Therefore, the expected value for Company A at the 3rd-move position that is realized when both sides choose their moves rationally is 9 hundred million yen, and the correct answer is イ.

  • Incorrectウ

    10 hundred million yen is the value of the cell for 1st move = do not cut price, 2nd move = do not cut price, 3rd move = advertise. To go down this branch, Company A must first choose not to cut price on the 1st move, and Company B must then also choose not to cut price on the 2nd move. However, Company B chooses so as to make Company A's expected value smaller, so under 1st move = do not cut price it chooses to cut price, which gives 0, and the branch with 10 is pruned away. Even if Company A did choose not to cut price on the 1st move, the value it could obtain would be only 0, which is worse than cutting price, which gives 9, so Company A does not choose this branch either.

  • Incorrectエ

    15 hundred million yen is the largest value in the table, but that cell is 1st move = cut price, 2nd move = do not cut price, which can be reached only on the premise that Company B cooperates. Company B moves so as to make Company A's expected value smaller, so under 1st move = cut price it does not choose do not cut price, which gives 15, but chooses cut price, which gives 9. Ignoring the existence of the opponent's turn and answering with the largest value in the table as it stands is the most common mistake in this type of question.

ここがポイント
  • The idea of backward induction and minimax — for a decision that involves an opponent, work back from the last move and fix the value of each position one by one. At a position where it is your own turn take the maximum of the child nodes, at a position where it is the opponent's turn take the minimum of the child nodes, and repeat this up to the root. In this question, evaluating in the order 3rd move (Company A = maximum) → 2nd move (Company B = minimum) → 1st move (Company A = maximum) gives 9.
  • In a decision tree, the largest value in the table does not become the answer just as it is — even for a cell with a favourable number, if there is an opponent's turn on the way to it, the opponent will prune it away. Always confirming reachability (whether the opponent really would choose that move) is the key point for not dropping marks on this format of question.
用語

Your answers