Hi !
Thanks a lot for your message.
This is a big big strat up project. I don’t think what I aim at has never been done in Python though. I want to use Julia for its speed.
There will be algorithms very complex in the future, but, at this point, as a start, I am looking for a program that, for example, extract a nash equilibrium (or MinMax strategy) from an outcome matrix. A matrix, that involves, let’s say at least 10 players. Values and numbers are not important at this point.
So 1/ we have the expression of the matrix, which we consider to be given.
And 2/ the nash equiibrium extraction.
The idea is this: if the outcome matrix has 150 players involved, it would be better to have a program checking the best solution as opposed to manual analysis.
Further on, I am going to implement behavioral algorithms, that will define the outcomes of the matrix (exemple: salience, complacency, random shocks, etc.), but that is a further step.
Carlino