The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria
DOI10.1007/BF02592075zbMath0638.90089OpenAlexW2049957162MaRDI QIDQ3780017
Gerard van der Laan, Timothy Mark Doup, Adolphus J. J. Talman
Publication date: 1987
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592075
excess demandvector labellingcomputation of economic equilibriaglobally and universally convergent price adjustment processvariable dimension simplicial restart algorithm
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) General equilibrium theory (91B50)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sandwich method for finding fixed points
- Some Examples of Global Instability of the Competitive Equilibrium
- Iterative Price Mechanisms
- An improvement of fixed point algorithms by using a good triangulation
- Equilibrium programming:The path following approach and dynamics
- Note on the path following approach of equilibrium programming
- A restart algorithm for computing fixed points without an extra dimension
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
- The Approximation of Fixed Points of a Continuous Mapping
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
This page was built for publication: The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria