Pages that link to "Item:Q5896921"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5896921):
Displaying 14 items.
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Worst-case equilibria (Q458478) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- On the structure and complexity of worst-case equilibria (Q883997) (← links)
- The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler (Q2197545) (← links)
- Greedy distributed optimization of multi-commodity flows (Q2377262) (← links)
- Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
- Tradeoffs in worst-case equilibria (Q2503349) (← links)
- (Q4026471) (← links)
- The Influence of Link Restrictions on (Random) Selfish Routing (Q5459969) (← links)
- Approximate Strong Equilibrium in Job Scheduling Games (Q5459972) (← links)
- Subjective vs. Objective Reality — The Risk of Running Late (Q5459993) (← links)