IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v57y2009i6p1421-1437.html
   My bibliography  Save this item

The Impact of Oligopolistic Competition in Networks

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Umang Bhaskar & Lisa Fleischer & Darrell Hoy & Chien-Chung Huang, 2015. "On the Uniqueness of Equilibrium in Atomic Splittable Routing Games," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 634-654, March.
  2. Satoru Fujishige & Michel X. Goemans & Tobias Harks & Britta Peis & Rico Zenklusen, 2017. "Matroids Are Immune to Braess’ Paradox," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 745-761, August.
  3. Meunier, Frédéric & Pradeau, Thomas, 2014. "The uniqueness property for networks with several origin–destination pairs," European Journal of Operational Research, Elsevier, vol. 237(1), pages 245-256.
  4. Nicole Adler & Eran Hanany & Stef Proost, 2022. "Competition in Congested Service Networks with Application to Air Traffic Control Provision in Europe," Management Science, INFORMS, vol. 68(4), pages 2751-2784, April.
  5. Simai He & Xiaoguo Wang & Shuzhong Zhang, 2013. "On a generalized Cournot oligopolistic competition game," Journal of Global Optimization, Springer, vol. 56(4), pages 1335-1345, August.
  6. Cheng Wan, 2012. "Coalitions in Nonatomic Network Congestion Games," Post-Print hal-02885914, HAL.
  7. Naimzada, Ahmad Kabir & Raimondo, Roberto, 2018. "Chaotic congestion games," Applied Mathematics and Computation, Elsevier, vol. 321(C), pages 333-348.
  8. Michal Feldman & Tami Tamir, 2012. "Conflicting Congestion Effects in Resource Allocation Games," Operations Research, INFORMS, vol. 60(3), pages 529-540, June.
  9. Igal Milchtaich, 2021. "Internalization of social cost in congestion games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 71(2), pages 717-760, March.
  10. Feng, Zengzhe & Gao, Ziyou & Sun, Huijun, 2014. "Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 63(C), pages 31-43.
  11. Tobias Harks & Konstantin Miller, 2011. "The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games," Operations Research, INFORMS, vol. 59(6), pages 1491-1503, December.
  12. Hugo E. Silva & Robin Lindsey & André de Palma & Vincent A. C. van den Berg, 2017. "On the Existence and Uniqueness of Equilibrium in the Bottleneck Model with Atomic Users," Transportation Science, INFORMS, vol. 51(3), pages 863-881, August.
  13. Sylvain Sorin & Cheng Wan, 2016. "Finite composite games: Equilibria and dynamics," Post-Print hal-02885860, HAL.
  14. Wan, Cheng, 2016. "Strategic decentralization in binary choice composite congestion games," European Journal of Operational Research, Elsevier, vol. 250(2), pages 531-542.
  15. Tobias Harks & Veerle Timmermans, 2018. "Uniqueness of equilibria in atomic splittable polymatroid congestion games," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 812-830, October.
  16. Angelelli, E. & Morandi, V. & Savelsbergh, M. & Speranza, M.G., 2021. "System optimal routing of traffic flows with user constraints using linear programming," European Journal of Operational Research, Elsevier, vol. 293(3), pages 863-879.
  17. Cheng Wan, 2012. "Coalitions in Nonatomic Network Congestion Games," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 654-669, November.
  18. Hota, Ashish R. & Garg, Siddharth & Sundaram, Shreyas, 2016. "Fragility of the commons under prospect-theoretic risk attitudes," Games and Economic Behavior, Elsevier, vol. 98(C), pages 135-164.
  19. Roughgarden, Tim & Schoppmann, Florian, 2015. "Local smoothness and the price of anarchy in splittable congestion games," Journal of Economic Theory, Elsevier, vol. 156(C), pages 317-342.
  20. Raimondo, Roberto, 2020. "Pathwise smooth splittable congestion games and inefficiency," Journal of Mathematical Economics, Elsevier, vol. 86(C), pages 15-23.
  21. Correa, José & Hoeksma, Ruben & Schröder, Marc, 2019. "Network congestion games are robust to variable demand," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 69-78.
  22. Vasilis Gkatzelis & Konstantinos Kollias & Tim Roughgarden, 2016. "Optimal Cost-Sharing in General Resource Selection Games," Operations Research, INFORMS, vol. 64(6), pages 1230-1238, December.
  23. Naimzada, A.K. & Raimondo, Roberto, 2018. "Heterogeneity and chaos in congestion games," Applied Mathematics and Computation, Elsevier, vol. 335(C), pages 278-291.
  24. Sylvain Sorin & Cheng Wan, 2013. "Delegation equilibrium payoffs in integer-splitting games," Post-Print hal-02885954, HAL.
  25. Charlson, G., 2020. "Searching for Results: Optimal Platform Design in a Network Setting," Cambridge Working Papers in Economics 20118, Faculty of Economics, University of Cambridge.
  26. Harks, Tobias & Schröder, Marc & Vermeulen, Dries, 2019. "Toll caps in privatized road networks," European Journal of Operational Research, Elsevier, vol. 276(3), pages 947-956.
  27. Olivier Brun & Balakrishna Prabhu, 2016. "Worst-case analysis of non-cooperative load balancing," Annals of Operations Research, Springer, vol. 239(2), pages 471-495, April.
  28. Kenjiro Takazawa, 2019. "Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1043-1065, November.
  29. Cheng Wan, 2016. "Strategic decentralization in binary choice composite congestion games," Post-Print hal-02885837, HAL.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.