eval(...)
.["leaf",u_{1},u_{2},...u_{n}]
where u_{i}
is the payoff of player i. ["node",i,c_{1},c_{2},...,c_{m}]
where i
is the index of the player to whom the node belongs, and c_{j}
is the j^{th} child.*
as suffix on the label, i.e. "leaf*"
or "node*"
.k
xm
matrix, i.e. k
lists of size m
, where k
is an integer, denoting the number of symbols in the alphabet, and m
is the number of leaves in the game.Tree structure 
Emission matrix 
Minization 
Additional properties Ensures the utility for the honest strategy remains unchanged. Ensures the deposit scheme does not lock away funds. 
Security parameters 
Output 

jsLPsolver
is used for solving the linear programs.