Pages that link to "Item:Q861255"
From MaRDI portal
The following pages link to The price of anarchy for polynomial social cost (Q861255):
Displaying 13 items.
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- A new model for selfish routing (Q952441) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- Distributed backup placement in networks (Q1741963) (← links)
- Stability vs. optimality in selfish ring routing (Q2453835) (← links)
- (Q5111703) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311131) (← links)
- Facets of the Fully Mixed Nash Equilibrium Conjecture (Q5459980) (← links)
- Price of anarchy for parallel link networks with generalized mean objective (Q6103184) (← links)
- Improved bounds for distributed load balancing (Q6534998) (← links)
- Which is the worst-case Nash equilibrium? (Q6552473) (← links)
