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]

@phdthesis{ethos-12426,
  title = {Efficient algorithms for computing approximate equilibria in bimatrix, polymatrix and Lipschitz games},
  author = {A. Deligkas},
  year = {2016},
  url = {http://livrepository.liverpool.ac.uk/3004688/},
  note = {British Library, EThOS},
  researchr = {https://researchr.org/publication/ethos-12426},
  cites = {0},
  citedby = {0},
  school = {University of Liverpool, UK},
}