Tree polymatrix games are PPAD-hard. / Deligkas, Argyrios; Fearnley, John; Savani, Rahul.

47th International Colloquium on Automata, Languages, and Programming, ICALP 2020. ed. / Artur Czumaj; Anuj Dawar; Emanuela Merelli. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2020. p. 1-14 38 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 168).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published
Original languageEnglish
Title of host publication47th International Colloquium on Automata, Languages, and Programming, ICALP 2020
EditorsArtur Czumaj, Anuj Dawar, Emanuela Merelli
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages1-14
Number of pages14
ISBN (Electronic)9783959771382
DOIs
Publication statusPublished - 29 Jun 2020
Event47th International Colloquium on Automata, Languages, and Programming, ICALP 2020 - Virtual, Online, Germany
Duration: 8 Jul 202011 Jul 2020

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume168
ISSN (Print)1868-8969

Conference

Conference47th International Colloquium on Automata, Languages, and Programming, ICALP 2020
CountryGermany
CityVirtual, Online
Period8/07/2011/07/20
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 38851947