ICALP 2020

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

Sep 23, 2020

|

25 views

Saarland Informatics Campus

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

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 2012: Session IVa "Planning and Scheduling in the Real World"

ICAPS | Aug 18, 2014

ICAPS 2012: Session IVb on "Learning & Local Search in Planning"

ICAPS | Aug 18, 2014

ICAPS 2012: Session V with "Best Papers"

ICAPS | Aug 18, 2014

ICAPS 2012: Session IIIb on "Enhancing Descriptions and Improving Plans"

ICAPS | Aug 18, 2014

ICAPS 2012: Session VIa on "Probabilistic and Non-Deterministic Planning"

ICAPS | Aug 18, 2014