Pages that link to "Item:Q987387"

The following pages link to Stackelberg strategies for atomic congestion games (Q987387):

Displaying 19 items.

• The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← links)
• Non-atomic one-round walks in congestion games (Q1731512) (← links)
• On the robustness of the approximate price of anarchy in generalized congestion games (Q2077399) (← links)
• FIFO and randomized competitive packet routing games (Q2085747) (← links)
• The power of one evil secret agent (Q2196556) (← links)
• The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
• Dynamic resource allocation games (Q2286736) (← links)
• Leadership in singleton congestion games: what is hard and what is easy (Q2289020) (← links)
• The sequential price of anarchy for affine congestion games with few players (Q2294284) (← links)
• On Stackelberg strategies in affine congestion games (Q2322708) (← links)
• Efficiency of Equilibria in Uniform Matroid Congestion Games (Q2819451) (← links)
• On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users (Q3162516) (← links)
• (Q3301024) (← links)
• On Stackelberg Strategies in Affine Congestion Games (Q3460782) (← links)
• A Selective Tour Through Congestion Games (Q3464474) (← links)
• (Q5002835) (← links)
• (Q5111703) (← links)
• Congestion games with priority-based scheduling (Q6049927) (← links)