Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Kousha Etessami' in GoogleThis author has not been identified. Look up 'Christos H. Papadimitriou' in GoogleThis author has not been identified. Look up 'Aviad Rubinstein' in GoogleThis author has not been identified. Look up 'Mihalis Yannakakis' in Google

runs on WebDSL