The Impact of Oligopolistic Competition in Networks
From MaRDI portal
Publication:3100438
DOI10.1287/opre.1080.0653zbMath1233.90064OpenAlexW3122760300WikidataQ65553911 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
Noncooperative games (91A10) Transportation, logistics and supply chain management (90B06) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (34)
Cost-Sharing in Generalised Selfish Routing ⋮ Worst-case analysis of non-cooperative load balancing ⋮ Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ On the Uniqueness of Equilibrium in Atomic Splittable Routing Games ⋮ Competitive online multicommodity routing ⋮ Strategic decentralization in binary choice composite congestion games ⋮ Equilibrium computation in resource allocation games ⋮ Collusion in atomic splittable routing games ⋮ On a generalized Cournot oligopolistic competition game ⋮ Coalitions in Nonatomic Network Congestion Games ⋮ Chaotic congestion games ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Stackelberg pricing games with congestion effects ⋮ PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES ⋮ Contribution games in networks ⋮ Unnamed Item ⋮ Toll caps in privatized road networks ⋮ The minimum tollbooth problem in atomic network congestion games with unsplittable flows ⋮ Collusion in Atomic Splittable Routing Games ⋮ Local smoothness and the price of anarchy in splittable congestion games ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ System optimal routing of traffic flows with user constraints using linear programming ⋮ Coordinating oligopolistic players in unrelated machine scheduling ⋮ The uniqueness property for networks with several origin-destination pairs ⋮ Fragility of the commons under prospect-theoretic risk attitudes ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function ⋮ Pathwise smooth splittable congestion games and inefficiency ⋮ Internalization of social cost in congestion games ⋮ Game efficiency through linear programming duality ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games ⋮ Chaotic triopoly game: a congestion case ⋮ Heterogeneity and chaos in congestion games ⋮ Finite composite games: equilibria and dynamics
This page was built for publication: The Impact of Oligopolistic Competition in Networks
