Efficient algorithms for computing approximate equilibria in bimatrix, polymatrix and Lipschitz games

A. Deligkas. Efficient algorithms for computing approximate equilibria in bimatrix, polymatrix and Lipschitz games. PhD thesis, University of Liverpool, UK, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.