ICALP 2020

D1.A — Tree Polymatrix Games are PPAD-hard

Sep 23, 2020

|

29 views

Saarland Informatics Campus

Details

ICALP-A 2020 Tree Polymatrix Games are PPAD-hard Argyrios Deligkas, John Fearnley, Rahul Savani

Category: ICALP 2020

Comments

loading...

Reactions (0) | Note

📝 No reactions yet

Be the first one to share your thoughts!

Reactions(0)

Note

loading...

Recommended

ICAPS 2014: Carmel Domshlak on "The Complexity of Optimal Monotonic Planning: The Bad, The ..."

ICAPS | Apr 16, 2015

ICAPS 2014: Xing Tan on "The Complexity of Partial-Order Plan Viability Problems"

ICAPS | Apr 16, 2015

ICAPS 2014: Nir Lipovetzky and Christina Burt on "Planning for Mining Operations with Time and ..."

ICAPS | Apr 16, 2015

ICAPS 2014: Christopher Expósito-Izquierdo on "Optimization Model and Heuristic Approach for ..."

ICAPS | Apr 16, 2015

ICAPS 2014: Iman Awaad on "Finding Ways to Get the Job Done: An Affordance-Based Approach"

ICAPS | Apr 20, 2015