The following pages link to Theoretical Computer Science (Q5897347):
Displaying 15 items.
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- Utilitarian resource assignment (Q866544) (← links)
- On the structure and complexity of worst-case equilibria (Q883997) (← links)
- Cost sharing mechanisms for fair pricing of resource usage (Q943873) (← links)
- How to find Nash equilibria with extreme total latency in network congestion games? (Q966426) (← links)
- Facets of the fully mixed Nash equilibrium conjecture (Q987401) (← links)
- Nash equilibria in all-optical networks (Q1043952) (← links)
- The equilibrium existence of a robust routing game under interval uncertainty (Q1617665) (← links)
- Incentives and coordination in bottleneck models (Q2190379) (← links)
- Structure and complexity of extreme Nash equilibria (Q2570130) (← links)
- Selfish unsplittable flows (Q2581267) (← links)
- A penalized best‐response algorithm for nonlinear single‐path routing problems (Q4565771) (← links)
- Structural Information and Communication Complexity (Q5315222) (← links)
- Computing Nash equilibria for scheduling on restricted parallel links (Q5917951) (← links)