Pages that link to "Item:Q838143"

The following pages link to The structure and complexity of Nash equilibria for a selfish routing game (Q838143):

Displaying 39 items.

• Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis (Q389954) (← links)
• Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
• Selfish bin coloring (Q411255) (← links)
• The price of anarchy on uniformly related machines revisited (Q418148) (← links)
• Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
• The complexity of pure equilibria in mix-weighted congestion games on parallel links (Q495670) (← 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)
• Competitive routing over time (Q719282) (← links)
• Mechanisms for (mis)allocating scientific credit (Q832517) (← links)
• Inefficiency of equilibria for scheduling game with machine activation costs (Q897948) (← links)
• Congestion games with capacitated resources (Q904685) (← links)
• A new model for selfish routing (Q952441) (← links)
• Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
• Window-games between TCP flows (Q982652) (← links)
• Network structure and strong equilibrium in route selection games. (Q1414825) (← links)
• The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
• A unifying approximate potential for weighted congestion games (Q2109950) (← links)
• Selfish load balancing for jobs with favorite machines (Q2294253) (← links)
• Temporal flows in temporal networks (Q2424668) (← links)
• Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
• Structure and complexity of extreme Nash equilibria (Q2570130) (← links)
• Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274) (← links)
• (Q2943337) (← links)
• Single Parameter FPT-Algorithms for Non-trivial Games (Q3000500) (← links)
• A Glimpse at Paul G. Spirakis (Q3464465) (← links)
• A Selective Tour Through Congestion Games (Q3464474) (← links)
• (Q4387130) (← links)
• (Q4737150) (← links)
• The Price of Stability of Weighted Congestion Games (Q5002839) (← links)
• The Price of Stability of Weighted Congestion Games (Q5242923) (← links)
• Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users (Q5388026) (← links)
• The Hardness of Selective Network Design for Bottleneck Routing Games (Q5425420) (← links)
• Automata, Languages and Programming (Q5466501) (← links)
• Scheduling games with rank-based utilities (Q6160122) (← links)
• Which is the worst-case Nash equilibrium? (Q6552473) (← links)
• Nash equilibria in two-resource congestion games with player-specific payoff functions (Q6555679) (← links)
• Monotonicity of equilibria in nonatomic congestion games (Q6565417) (← links)
• The existence of a pure-strategy Nash equilibrium in a discrete ponds dilemma (Q6634102) (← links)