The following pages link to Dominic Dumrauf (Q1935799):
Displaying 6 items.
- On the \(\mathcal {PLS}\)-complexity of maximum constraint assignment (Q1935800) (← links)
- Exact Price of Anarchy for Polynomial Congestion Games (Q3115864) (← links)
- On the Complexity of Local Search for Weighted Standard Set Problems (Q3576199) (← links)
- Local Search: Simple, Successful, But Sometimes Sluggish (Q3587365) (← links)
- COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE (Q5408357) (← links)
- Exact Price of Anarchy for Polynomial Congestion Games (Q5449800) (← links)
