Tree polymatrix games are PPAD-hard

Argyrios Deligkas, John Fearnley, Rahul Savani

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

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
Country/TerritoryGermany
CityVirtual, Online
Period8/07/2011/07/20

Keywords

  • Brouwer Fixed Points
  • Nash Equilibria
  • Polymatrix Games
  • PPAD

Cite this