Zejin Shi
Zejin Shi
Thanks for your review @cc7768! It is very helpful. There are two things in my mind that might improve the efficiency: 1. The way to get rid of redundant points....
@oyamad Currently the performance is still not as desirable. But it seems that there has been many updates in `Polyhedra.jl`. I will check in a few days to see if...
Vote for `Games.Generators` as it allows users to choose different input, rather than just offers different kinds of games with unchangeable payoff matrices.
- Yes that is what I mean. At least `SimpleHRepresentation`, `SimpleVRepresentation`, and `SimplePolyhedron` do not show the correspondence between vertices in `VRepresentation` and the binding inequalities in `HRepresentation` directly (they...
After discussion in JuliaPolyhedra/Polyhedra.jl#60, I tried to use `HRepIterator` and `hyperplane` to find out indices of binding inequalities for each vertex. The speed is improved, but still lower than `support_enumeration`....
It turns out that `QHull.QHullLibrary()` is much faster. But to use this library, the polyhedron must contains origin as interior point. Is this the reason that you translate payoff arrays...
@oyamad Sorry for pushing the wrong file. Modified.
Hi @bktaha we are concerned about the nonexistence of stable solution when `beta >= 1` and this shall not be solved by simply adding more iterations. You may check that...
@mmcky Sure I'll have a try!
Hi @najuzilu I haven't got enough progress on this. Still working on it. Do you have any suggestions?