IDEAS home Printed from https://ideas.repec.org/p/nwu/cmsems/314.html
   My bibliography  Save this paper

Studying Economic Equilibria on Affine Networks Via Lemke's Algorithm

Author

Listed:
  • Richard Asmuth

Abstract

No abstract is available for this item.

Suggested Citation

  • Richard Asmuth, 1978. "Studying Economic Equilibria on Affine Networks Via Lemke's Algorithm," Discussion Papers 314, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    • Handle: RePEc:nwu:cmsems:314
    as

    Download full text from publisher

    File URL: http://www.kellogg.northwestern.edu/research/math/papers/314.pdf
    File Function: main text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. C. E. Lemke, 1965. "Bimatrix Equilibrium Points and Mathematical Programming," Management Science, INFORMS, vol. 11(7), pages 681-689, May.
    2. Elmor L. Peterson, 1976. "The Conical Duality and Complementarity of Price and Quality for Multicommodity Spatial and Temporal Network Allocation Problems," Discussion Papers 207, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Computing Integral Solutions of Complementarity Problems," Other publications TiSEM b8e0c74e-2219-4ab0-99a2-0, Tilburg University, School of Economics and Management.
    2. Zhang, Bin, 2012. "Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints," European Journal of Operational Research, Elsevier, vol. 218(2), pages 426-434.
    3. Baohua Huang & Wen Li, 2023. "A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems," Computational Optimization and Applications, Springer, vol. 86(1), pages 345-381, September.
    4. Talman, A.J.J. & van der Heyden, L., 1981. "Algorithms for the linear complementarity problem which allow an arbitrary starting point," Research Memorandum FEW 99, Tilburg University, School of Economics and Management.
    5. Bernhard von Stengel & Antoon van den Elzen & Dolf Talman, 2002. "Computing Normal Form Perfect Equilibria for Extensive Two-Person Games," Econometrica, Econometric Society, vol. 70(2), pages 693-715, March.
    6. Christian Bidard, 2012. "The Frail Grounds of the Ricardian Dynamics," Working Papers hal-04141039, HAL.
    7. R. B. Bapat & S. K. Neogy, 2016. "On a quadratic programming problem involving distances in trees," Annals of Operations Research, Springer, vol. 243(1), pages 365-373, August.
    8. Frederic Murphy & Axel Pierru & Yves Smeers, 2016. "A Tutorial on Building Policy Models as Mixed-Complementarity Problems," Interfaces, INFORMS, vol. 46(6), pages 465-481, December.
    9. Porter, Ryan & Nudelman, Eugene & Shoham, Yoav, 2008. "Simple search methods for finding a Nash equilibrium," Games and Economic Behavior, Elsevier, vol. 63(2), pages 642-662, July.
    10. Benjamin F. Hobbs & J. S. Pang, 2007. "Nash-Cournot Equilibria in Electric Power Markets with Piecewise Linear Demand Functions and Joint Constraints," Operations Research, INFORMS, vol. 55(1), pages 113-127, February.
    11. Rahul Savani & Bernhard von Stengel, 2016. "Unit vector games," International Journal of Economic Theory, The International Society for Economic Theory, vol. 12(1), pages 7-27, March.
    12. Zhe Liu & Yahya Fathi, 2012. "The nearest point problem in a polyhedral set and its extensions," Computational Optimization and Applications, Springer, vol. 53(1), pages 115-130, September.
    13. V. Venkateswaran, 1991. "A descent approach to solving the complementary programming problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 679-698, October.
    14. Murray, Timothy & Garg, Jugal & Nagi, Rakesh, 2021. "Limited-trust equilibria," European Journal of Operational Research, Elsevier, vol. 289(1), pages 364-380.
    15. Peter Godfrey-Smith & Manolo Martínez, 2013. "Communication and Common Interest," PLOS Computational Biology, Public Library of Science, vol. 9(11), pages 1-6, November.
    16. S. R. Mohan, 1997. "Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 409-423, August.
    17. Bidard, Christian, 2014. "The Ricardian rent theory: an overview," Centro Sraffa Working Papers CSWP8, Centro di Ricerche e Documentazione "Piero Sraffa".
    18. Bahrami, Sina & Roorda, Matthew J., 2020. "Optimal traffic management policies for mixed human and automated traffic flows," Transportation Research Part A: Policy and Practice, Elsevier, vol. 135(C), pages 130-143.
    19. Harry M. Markowitz, 2002. "Efficient Portfolios, Sparse Matrices, and Entities: A Retrospective," Operations Research, INFORMS, vol. 50(1), pages 154-160, February.
    20. A. T. Phillips & J. B. Rosen, 1990. "Guaranteed ϵ‐approximate solution for indefinite quadratic global minimization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 499-514, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:314. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Fran Walker (email available below). General contact details of provider: https://edirc.repec.org/data/cmnwuus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.