Macaulay2 » Documentation
Packages » GameTheory :: assemblePlayeriPolynomials
next | previous | forward | backward | up | index | toc

assemblePlayeriPolynomials -- get all incentive constraint polynomials for a player

Description

For a given player $i$, this method computes all incentive constraint polynomials $\forall k,l \in [d_i]$, representing deviations from strategy $k$ to $l$.

i1 : R = QQ[p_{0,0}, p_{0,1}, p_{1,0}, p_{1,1}];
i2 : Xi = randomTensor(QQ, {2,2});
i3 : assemblePlayeriPolynomials(R, Xi, 0)

         15          1           15          1
o3 = {0, --p       + -p      , - --p       - -p      , 0}
          4 {0, 0}   2 {0, 1}     4 {1, 0}   2 {1, 1}

o3 : List

See also

Ways to use assemblePlayeriPolynomials:

  • assemblePlayeriPolynomials(Ring,Tensor,ZZ)

For the programmer

The object assemblePlayeriPolynomials is a method function.


The source of this document is in GameTheory.m2:1254:0.