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]

Possibly Related Publications

The following publications are possibly variants of this publication: