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]

Authors

A. Deligkas

This author has not been identified. Look up 'A. Deligkas' in Google