Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria

Kousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, Mihalis Yannakakis. Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. In Thomas Vidick, editor, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA. Volume 151 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

@inproceedings{EtessamiPRY20,
  title = {Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria},
  author = {Kousha Etessami and Christos H. Papadimitriou and Aviad Rubinstein and Mihalis Yannakakis},
  year = {2020},
  doi = {10.4230/LIPIcs.ITCS.2020.18},
  url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.18},
  researchr = {https://researchr.org/publication/EtessamiPRY20},
  cites = {0},
  citedby = {0},
  booktitle = {11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA},
  editor = {Thomas Vidick},
  volume = {151},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-134-4},
}