Pages that link to "Item:Q5898471"

The following pages link to Approximation and Online Algorithms (Q5898471):

Displaying 17 items.

• Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
• Network topology and equilibrium existence in weighted network congestion games (Q495752) (← links)
• Performance of one-round walks in linear congestion games (Q647486) (← links)
• Competitive routing over time (Q719282) (← links)
• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← links)
• Some results of Maria Serna on strategic games: complexity of equilibria and models (Q826318) (← links)
• The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
• Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
• How to find Nash equilibria with extreme total latency in network congestion games? (Q966426) (← links)
• How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
• Computing equilibrium in network utility-sharing and discrete election games (Q2082218) (← links)
• Collusion in atomic splittable routing games (Q2392243) (← links)
• Greediness and equilibrium in congestion games (Q2453056) (← links)
• The complexity of welfare maximization in congestion games (Q2892161) (← links)
• A Selective Tour Through Congestion Games (Q3464474) (← links)
• Malicious Bayesian Congestion Games (Q3602834) (← links)
• (Q5002835) (← links)