Pages that link to "Item:Q3100438"

The following pages link to The Impact of Oligopolistic Competition in Networks (Q3100438):

Displaying 34 items.

• Finite composite games: equilibria and dynamics (Q261241) (← links)
• Worst-case analysis of non-cooperative load balancing (Q291317) (← links)
• Strategic decentralization in binary choice composite congestion games (Q322512) (← links)
• Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
• Fragility of the commons under prospect-theoretic risk attitudes (Q738933) (← links)
• Competitive online multicommodity routing (Q839644) (← links)
• Uniqueness of equilibria in atomic splittable polymatroid congestion games (Q1631639) (← links)
• Toll caps in privatized road networks (Q1734347) (← links)
• System optimal routing of traffic flows with user constraints using linear programming (Q2030327) (← links)
• Internalization of social cost in congestion games (Q2061126) (← links)
• Chaotic triopoly game: a congestion case (Q2078167) (← links)
• Equilibrium computation in resource allocation games (Q2149542) (← links)
• The minimum tollbooth problem in atomic network congestion games with unsplittable flows (Q2230724) (← links)
• Local smoothness and the price of anarchy in splittable congestion games (Q2253842) (← links)
• Pathwise smooth splittable congestion games and inefficiency (Q2304200) (← links)
• Heterogeneity and chaos in congestion games (Q2335582) (← links)
• Collusion in atomic splittable routing games (Q2392243) (← links)
• On a generalized Cournot oligopolistic competition game (Q2393078) (← links)
• Chaotic congestion games (Q2423058) (← links)
• Contribution games in networks (Q2429340) (← links)
• Coordinating oligopolistic players in unrelated machine scheduling (Q2514126) (← links)
• The uniqueness property for networks with several origin-destination pairs (Q2514826) (← links)
• The price of anarchy in nonatomic consumption-relevance congestion games (Q2811296) (← links)
• Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games (Q2835665) (← links)
• Coalitions in Nonatomic Network Congestion Games (Q2925351) (← links)
• Optimal Cost-Sharing in General Resource Selection Games (Q2957453) (← links)
• Collusion in Atomic Splittable Routing Games (Q3012948) (← links)
• On the Uniqueness of Equilibrium in Atomic Splittable Routing Games (Q3449452) (← links)
• (Q5009624) (← links)
• Game efficiency through linear programming duality (Q5090446) (← links)
• Cost-Sharing in Generalised Selfish Routing (Q5283373) (← links)
• PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES (Q5358089) (← links)
• Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function (Q5919290) (← links)
• Stackelberg pricing games with congestion effects (Q6120892) (← links)