1. The document describes an algorithm for game theory optimization using Nash equilibriums.
2. It performs several iterations of evaluating different strategy combinations for players and selecting the combination that maximizes each player's payoff given other player's strategies.
3. The aim is to find a Nash equilibrium where no player can benefit by changing only their own strategy.
3. φογϡߧۉ
ఆٛɿ࠷దԠઓུ
ϓϨΠϠʔ Ҏ֎ͷઓུΛ ͱ͠ݻఆ͢Δ
Λຬͨ͢ͱ͖ ʹର͢Δ࠷దԠઓུͱ͍͏
ఆٛɿφογϡߧۉ
ઓུͷ ͕φογϡ͋ͰߧۉΔͱ
ͯ͢ͷϓϨΠϠʔʹରͯ͠
φογϡߧۉ
࠷ʹ͍ޓదԠઓུͱͳ͍ͬͯΔઓུͷ
i s−i
∈ S−i
fi
(s *i
, s−i
) ≥ fi
(si
, s−i
), ∀si
∈ Si
s *i
s−i
(s*1
, ⋯, s*n
) ∈ S
fi
(s*i
, s*−i
) ≥ fi
(si
, s*−i
) ∀si
∈ Si
AʘB C C
B
B
B
22. ಛੑؔܗήʔϜΛߟ͍͑ͨ
v({1,2,3}) = 6
v({1,2}) = max (min(2,1), min(5,0), min(2,0), min(4,1)) = max(1,0,0,1) = 1
ิɿ3ਓήʔϜͷઓུܗήʔϜ͔ΒಛੑؔܗήʔϜ
͕७ઓུD
1ʘ2 C C
B
B
͕७ઓུD
1ʘ2 C C
B
B
23. ಛੑؔܗήʔϜΛߟ͍͑ͨ
v({1,2,3}) = 6
v({1,2}) = max (min(2,1), min(5,0), min(2,0), min(4,1)) = max(1,0,0,1) = 1
v({1,3}) = max (min(2,2), min(2,3), min(3,3), min(4,1)) = max(2,2,3,0) = 3
ิɿ3ਓήʔϜͷઓུܗήʔϜ͔ΒಛੑؔܗήʔϜ
͕७ઓུD
1ʘ2 C C
B
B
͕७ઓུD
1ʘ2 C C
B
B
24. ಛੑؔܗήʔϜΛߟ͍͑ͨ
v({1,2,3}) = 6
v({1,2}) = max (min(2,1), min(5,0), min(2,0), min(4,1)) = max(1,0,0,1) = 1
v({1,3}) = max (min(2,2), min(2,3), min(3,3), min(4,1)) = max(2,2,3,0) = 3
v({2,3}) = max (min(2,2), min(0,3), min(2,3), min(3,1)) = max(2,0,2,1) = 2
ิɿ3ਓήʔϜͷઓུܗήʔϜ͔ΒಛੑؔܗήʔϜ
͕७ઓུD
1ʘ2 C C
B
B
͕७ઓུD
1ʘ2 C C
B
B
25. ಛੑؔܗήʔϜΛߟ͍͑ͨ
v({1,2,3}) = 6
v({1,2}) = max (min(2,1), min(5,0), min(2,0), min(4,1)) = max(1,0,0,1) = 1
v({1,3}) = max (min(2,2), min(2,3), min(3,3), min(4,1)) = max(2,2,3,0) = 3
v({2,3}) = max (min(2,2), min(0,3), min(2,3), min(3,1)) = max(2,0,2,1) = 2
v({1}) = v({2}) = v({3}) = 0
ิɿ3ਓήʔϜͷઓུܗήʔϜ͔ΒಛੑؔܗήʔϜ
͕७ઓུD
1ʘ2 C C
B
B
͕७ઓུD
1ʘ2 C C
B
B