Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Dimitris Fotakis, Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis. Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. In Artur Czumaj, Anuj Dawar, Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference). Volume 168 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

This author has not been identified. Look up 'Dimitris Fotakis' in GoogleThis author has not been identified. Look up 'Vardis Kandiros' in GoogleThis author has not been identified. Look up 'Thanasis Lianeas' in GoogleThis author has not been identified. Look up 'Nikos Mouzakis' in GoogleThis author has not been identified. Look up 'Panagiotis Patsilinakos' in GoogleThis author has not been identified. Look up 'Stratis Skoulakis' in Google

runs on WebDSL