Pages that link to "Item:Q3581415"

The following pages link to The price of anarchy of finite congestion games (Q3581415):

Displaying 50 items.

• Concurrent imitation dynamics in congestion games (Q287990) (← links)
• Mixing time and stationary expected social welfare of logit dynamics (Q372983) (← links)
• Social context congestion games (Q386894) (← links)
• Convergence and approximation in potential games (Q441854) (← links)
• Pairwise cooperations in selfish ring routing for minimax linear latency (Q443709) (← links)
• Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness (Q503458) (← links)
• Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
• Good programming in transactional memory: game theory meets multicore architecture (Q553350) (← links)
• The equivalence of uniform and Shapley value-based cost allocations in a specific game (Q614035) (← links)
• Convergence to approximate Nash equilibria in congestion games (Q632952) (← links)
• On the performance of approximate equilibria in congestion games (Q634681) (← links)
• Graphical congestion games (Q639291) (← links)
• Congestion games with failures (Q642974) (← links)
• Tight bounds for selfish and greedy load balancing (Q644806) (← links)
• Performance of one-round walks in linear congestion games (Q647486) (← links)
• On best response dynamics in weighted congestion games with polynomial delays (Q661067) (← links)
• Design of price mechanisms for network resource allocation via price of anarchy (Q662298) (← links)
• The impact of social ignorance on weighted congestion games (Q692896) (← links)
• Competitive routing over time (Q719282) (← links)
• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← links)
• Network design with weighted players (Q733733) (← links)
• On the Price of Anarchy of cost-sharing in real-time scheduling systems (Q777962) (← links)
• Strong equilibrium in cost sharing connection games (Q834855) (← links)
• The impact of local policies on the quality of packet routing in paths, trees, and rings (Q835620) (← links)
• Coordination mechanisms (Q838145) (← links)
• Atomic routing games on maximum congestion (Q838146) (← links)
• Competitive online multicommodity routing (Q839644) (← links)
• The price of anarchy for polynomial social cost (Q861255) (← links)
• Congestion games with capacitated resources (Q904685) (← links)
• Inefficiency of games with social context (Q904696) (← links)
• The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
• Scheduling to maximize participation (Q935466) (← links)
• A new model for selfish routing (Q952441) (← 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)
• The price of atomic selfish ring routing (Q975753) (← links)
• Stackelberg strategies for atomic congestion games (Q987387) (← links)
• Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
• Efficient graph topologies in network routing games (Q1021587) (← links)
• How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
• Tight inefficiency bounds for perception-parameterized affine congestion games (Q1628591) (← links)
• Non-atomic one-round walks in congestion games (Q1731512) (← links)
• Colocating tasks in data centers using a side-effects performance model (Q1754339) (← links)
• On the robustness of the approximate price of anarchy in generalized congestion games (Q2077399) (← links)
• Atomic congestion games with random players: network equilibrium and the price of anarchy (Q2082222) (← links)
• Non-blind strategies in timed network congestion games (Q2112118) (← links)
• Timed network games (Q2112796) (← links)
• The Price of Anarchy of generic valid utility systems (Q2149873) (← links)
• The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)
• Equilibria in routing games with edge priorities (Q2190414) (← links)