Computing Constrained Approximate Equilibria in Polymatrix Games

Argyrios Deligkas, John Fearnley, Rahul Savani. Computing Constrained Approximate Equilibria in Polymatrix Games. In Vittorio Bilò, Michele Flammini, editors, Algorithmic Game Theory - 10th International Symposium, SAGT 2017, L'Aquila, Italy, September 12-14, 2017, Proceedings. Volume 10504 of Lecture Notes in Computer Science, pages 93-105, Springer, 2017. [doi]

@inproceedings{DeligkasFS17,
  title = {Computing Constrained Approximate Equilibria in Polymatrix Games},
  author = {Argyrios Deligkas and John Fearnley and Rahul Savani},
  year = {2017},
  doi = {10.1007/978-3-319-66700-3_8},
  url = {https://doi.org/10.1007/978-3-319-66700-3_8},
  researchr = {https://researchr.org/publication/DeligkasFS17},
  cites = {0},
  citedby = {0},
  pages = {93-105},
  booktitle = {Algorithmic Game Theory - 10th International Symposium, SAGT 2017, L'Aquila, Italy, September 12-14, 2017, Proceedings},
  editor = {Vittorio Bilò and Michele Flammini},
  volume = {10504},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-66700-3},
}