|
Search: id:A134815
|
|
|
| A134815 |
|
Leader-Follower four person 4 X 4 matrix zero sum game Markov in a 16 by 16 matrix: Follower matrix: MA={{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, 1}}: game value =1/3 Leader Matrix: MB={{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, 5}}: game value=-1 Characteristic polynomial: 1 + 8 x^3 - 4 x^4 + 18 x^6 - 24 x^7 + 6 x^8 + 16 x^9 - 36 x^10 + 24 x^11 + x^12 - 16 x^13 + 18 x^14 - 8 x^15 + x^16). |
|
+0
1
|
|
| 4, 9, 35, 162, 790, 3923, 19602, 98108, 491242, 2460009, 12319475, 61695247, 308967153, 1547295326, 7748795485, 38805671816, 194337325053, 973233918963, 4873918388052, 24408397608972, 122236325365629, 612154860741196
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Ratio is: 5.00796 Roots: three copies of the theta1 4b4 Pisot and new pisot NSolve[ -1 - 5 x^3 + x^4 == 0, x] {{x -> -0.564325}, {x -> 0.278181 - 0.525792I}, {x -> 0.278181 + 0.525792I]}, {x -> 5.00796}} Total game value: Det[M]/(Sum[Sum[If[i == j, M[[i, j]], 0], {i, 1, 16}], {j, 1, 16}] - Sum[Sum[If[i ==j, 0, M[[i, j]]], {i, 1, 16}], {j, 1, 16}])=-1/8 It seems possible that this kind of game cam be generalized to: Follower:Game_Value[MA]=1/(n-1) Leader:Game_Value[MB]=-1 Where the leader gets an (n+1) point payoff.
|
|
FORMULA
|
M = {{0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 5}} v[1] = {1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1}; v[n]=M.v[n-1]; a(n) = Sum[v[n][[i]],{i,1,16}]
|
|
MATHEMATICA
|
M = {{0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 5}}; v[1] = {1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1}; v[n_] := v[n] = M.v[n - 1]; a = Table[Apply[Plus, v[n]], {n, 1, 50}] Det[M - x*IdentityMatrix[16]] Factor[%] aaa = Table[x /. NSolve[Det[M - x*IdentityMatrix[16]] == 0, x][[n]], {n, 1, 16}] a1 = Table[N[a[[n]]/a[[n - 1]]], {n, 7, 50}]
|
|
CROSSREFS
|
Adjacent sequences: A134812 A134813 A134814 this_sequence A134816 A134817 A134818
Sequence in context: A149136 A006392 A084449 this_sequence A120073 A056894 A117676
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 28 2008
|
|
|
Search completed in 0.002 seconds
|
