Pages that link to "Item:Q5901105"

The following pages link to The Price of Routing Unsplittable Flow (Q5901105):

Displaying 50 items.

• A game-theoretic algorithm for non-linear single-path routing problems (Q325393) (← links)
• Partition equilibrium always exists in resource selection games (Q372982) (← 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)
• Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
• The equivalence of uniform and Shapley value-based cost allocations in a specific game (Q614035) (← links)
• Local and global price of anarchy of graphical games (Q631783) (← 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)
• 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)
• 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)
• Non-cooperative facility location and covering games (Q964406) (← 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)
• Efficiency of atomic splittable selfish routing with polynomial cost functions (Q1024062) (← links)
• How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
• The line planning routing game (Q1634301) (← links)
• Non-atomic one-round walks in congestion games (Q1731512) (← links)
• Colocating tasks in data centers using a side-effects performance model (Q1754339) (← links)
• Equilibrium strategies for multiple interdictors on a common network (Q2028891) (← 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)
• The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)
• Equilibria in routing games with edge priorities (Q2190414) (← links)
• Smart routing of electric vehicles for load balancing in smart grids (Q2203089) (← links)
• Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
• The sequential price of anarchy for affine congestion games with few players (Q2294284) (← links)
• On Stackelberg strategies in affine congestion games (Q2322708) (← links)