D1.D — Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games

ICALP 2020

D1.D — Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games

Sep 23, 2020
|
21 views
Details
ICALP-A 2020 Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games Dimitris Fotakis, Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos and Stratis Skoulakis

Comments
loading...