Tree polymatrix games are PPAD-hard

Argyrios Deligkas; John Fearnley; Rahul Savani

doi:10.4230/LIPIcs.ICALP.2020.38

Tree polymatrix games are PPAD-hard

Argyrios Deligkas, John Fearnley, Rahul Savani

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	47th International Colloquium on Automata, Languages, and Programming, ICALP 2020
Editors	Artur Czumaj, Anuj Dawar, Emanuela Merelli
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages	1-14
Number of pages	14
ISBN (Electronic)	9783959771382
DOIs	https://doi.org/10.4230/LIPIcs.ICALP.2020.38
Publication status	Published - 29 Jun 2020
Event	47th International Colloquium on Automata, Languages, and Programming, ICALP 2020 - Virtual, Online, Germany Duration: 8 Jul 2020 → 11 Jul 2020

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	168
ISSN (Print)	1868-8969

Conference

Conference	47th International Colloquium on Automata, Languages, and Programming, ICALP 2020
Country/Territory	Germany
City	Virtual, Online
Period	8/07/20 → 11/07/20

Keywords

Brouwer Fixed Points
Nash Equilibria
Polymatrix Games
PPAD

Access to Document

10.4230/LIPIcs.ICALP.2020.38Licence: CC BY

Cite this

Deligkas, A., Fearnley, J., & Savani, R. (2020). Tree polymatrix games are PPAD-hard. In A. Czumaj, A. Dawar, & E. Merelli (Eds.), 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020 (pp. 1-14). Article 38 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 168). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2020.38

Deligkas, Argyrios ; Fearnley, John ; Savani, Rahul. / Tree polymatrix games are PPAD-hard. 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020. editor / Artur Czumaj ; Anuj Dawar ; Emanuela Merelli. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2020. pp. 1-14 (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{715a359bf3f14212b46d187664736520,

title = "Tree polymatrix games are PPAD-hard",

keywords = "Brouwer Fixed Points, Nash Equilibria, Polymatrix Games, PPAD",

author = "Argyrios Deligkas and John Fearnley and Rahul Savani",

year = "2020",

month = jun,

day = "29",

doi = "10.4230/LIPIcs.ICALP.2020.38",

language = "English",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

pages = "1--14",

editor = "Artur Czumaj and Anuj Dawar and Emanuela Merelli",

booktitle = "47th International Colloquium on Automata, Languages, and Programming, ICALP 2020",

note = "47th International Colloquium on Automata, Languages, and Programming, ICALP 2020 ; Conference date: 08-07-2020 Through 11-07-2020",

}

Deligkas, A, Fearnley, J & Savani, R 2020, Tree polymatrix games are PPAD-hard. in A Czumaj, A Dawar & E Merelli (eds), 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020., 38, Leibniz International Proceedings in Informatics, LIPIcs, vol. 168, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 1-14, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Virtual, Online, Germany, 8/07/20. https://doi.org/10.4230/LIPIcs.ICALP.2020.38

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 proceeding › Conference contribution

TY - GEN

T1 - Tree polymatrix games are PPAD-hard

AU - Deligkas, Argyrios

AU - Fearnley, John

AU - Savani, Rahul

PY - 2020/6/29

Y1 - 2020/6/29

KW - Brouwer Fixed Points

KW - Nash Equilibria

KW - Polymatrix Games

KW - PPAD

UR - http://www.scopus.com/inward/record.url?scp=85089348585&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ICALP.2020.38

DO - 10.4230/LIPIcs.ICALP.2020.38

M3 - Conference contribution

AN - SCOPUS:85089348585

T3 - Leibniz International Proceedings in Informatics, LIPIcs

SP - 1

EP - 14

BT - 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020

A2 - Czumaj, Artur

A2 - Dawar, Anuj

A2 - Merelli, Emanuela

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020

Y2 - 8 July 2020 through 11 July 2020

ER -

Deligkas A, Fearnley J, Savani R. Tree polymatrix games are PPAD-hard. In Czumaj A, Dawar A, Merelli E, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2020. p. 1-14. 38. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.ICALP.2020.38

Tree polymatrix games are PPAD-hard

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this