The following pages link to The price of selfish routing (Q996709):
Displaying 50 items.
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- Traffic routing oligopoly (Q302120) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- Selfish bin coloring (Q411255) (← links)
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Worst-case equilibria (Q458478) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- Game-theoretic analysis of Internet switching with selfish users (Q714792) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- Minimizing expectation plus variance (Q904686) (← links)
- Cost sharing mechanisms for fair pricing of resource usage (Q943873) (← links)
- A new model for selfish routing (Q952441) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- The price of atomic selfish ring routing (Q975753) (← links)
- Facets of the fully mixed Nash equilibrium conjecture (Q987401) (← links)
- Self-fulfilling signal of an endogenous state in network congestion games (Q1642952) (← links)
- Strategic pricing in next-hop routing with elastic demands (Q1678765) (← links)
- Approximate equilibria and ball fusion (Q1762998) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- Selfish vector packing (Q1979465) (← links)
- Constraint games for stable and optimal allocation of demands in SDN (Q2009195) (← links)
- The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
- Quality of strong equilibria for selfish bin packing with uniform cost sharing (Q2304118) (← links)
- Scheduling selfish jobs on multidimensional parallel machines (Q2404079) (← links)
- On equilibria for ADM minimization games (Q2429352) (← links)
- Stability vs. optimality in selfish ring routing (Q2453835) (← links)
- Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
- How much can taxes help selfish routing? (Q2495395) (← links)
- Tradeoffs in worst-case equilibria (Q2503349) (← links)
- Worst-case Nash equilibria in restricted routing (Q2637289) (← links)
- Coordination complexity: small information coordinating large populations (Q2800576) (← links)
- The complexity of welfare maximization in congestion games (Q2892161) (← links)
- Fast convergence of selfish rerouting (Q2921740) (← links)
- Selfish routing with atomic players (Q2921792) (← links)
- The Impact of Oligopolistic Competition in Networks (Q3100438) (← links)
- Bottleneck Congestion Games with Logarithmic Price of Anarchy (Q3162521) (← links)
- How bad is selfish routing? (Q3196642) (← links)
- Fast, Fair, and Efficient Flows in Networks (Q3392070) (← links)
- Selfish Vector Packing (Q3452809) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- A bin packing game with cardinality constraints under the best cost rule (Q4634294) (← links)
- (Q4828932) (← links)
- The Value of Information in Selfish Routing (Q5100972) (← links)
- STACS 2004 (Q5309730) (← links)
