The Impact of Oligopolistic Competition in Networks
From MaRDI portal
Publication:3100438
DOI10.1287/opre.1080.0653zbMath1233.90064WikidataQ65553911 ScholiaQ65553911MaRDI QIDQ3100438
José R. Correa, Nicolás E. Stier-Moses, Roberto Cominetti
Publication date: 24 November 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1080.0653
91A10: Noncooperative games
90B06: Transportation, logistics and supply chain management
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Unnamed Item, Game efficiency through linear programming duality, Cost-Sharing in Generalised Selfish Routing, PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES, Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function, Stackelberg pricing games with congestion effects, Finite composite games: equilibria and dynamics, Worst-case analysis of non-cooperative load balancing, Strategic decentralization in binary choice composite congestion games, Stackelberg strategies and collusion in network games with splittable flow, Fragility of the commons under prospect-theoretic risk attitudes, Competitive online multicommodity routing, Uniqueness of equilibria in atomic splittable polymatroid congestion games, Toll caps in privatized road networks, System optimal routing of traffic flows with user constraints using linear programming, Internalization of social cost in congestion games, Chaotic triopoly game: a congestion case, Equilibrium computation in resource allocation games, The minimum tollbooth problem in atomic network congestion games with unsplittable flows, Local smoothness and the price of anarchy in splittable congestion games, Pathwise smooth splittable congestion games and inefficiency, Heterogeneity and chaos in congestion games, Collusion in atomic splittable routing games, On a generalized Cournot oligopolistic competition game, Chaotic congestion games, Contribution games in networks, Coordinating oligopolistic players in unrelated machine scheduling, The uniqueness property for networks with several origin-destination pairs, The price of anarchy in nonatomic consumption-relevance congestion games, Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games, Coalitions in Nonatomic Network Congestion Games, Optimal Cost-Sharing in General Resource Selection Games, Collusion in Atomic Splittable Routing Games, On the Uniqueness of Equilibrium in Atomic Splittable Routing Games
