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

assemblePolynomial -- compute incentive constraint polynomial for deviation

Description

This function computes a linear inequality encoding the condition for a correlated equilibrium: the expected utility from playing $k$ should be no less than from playing $l$.

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

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

o3 : R

See also

Ways to use assemblePolynomial:

  • assemblePolynomial(Ring,Tensor,List)

For the programmer

The object assemblePolynomial is a method function.


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