A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices

DOI10.1007/BF02591741zbMath0616.90084OpenAlexW1991765363MaRDI QIDQ4726068

Adolphus J. J. Talman, Timothy Mark Doup

Publication date: 1987

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02591741

zbMATH Keywords

triangulationapproximate solutionnonlinear complementarity problemtrade modelsexchange economiesvector labellingsimplicial variable dimension restart algorithmcomputation of equilibria in noncooperative games

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (10)

A continuous deformation algorithm for variational inequality problems on polytopes ⋮ Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems ⋮ The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria ⋮ Simplicial algorithm to solve the nonlinear complementarity problem on \(S^ n\times R^ m_ +\) ⋮ A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form ⋮ A constructive proof of Ky Fan's coincidence theorem ⋮ A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications ⋮ The transition from a Drèze equilibrium to a Walrasian equilibrium ⋮ A lexicographic algebraic theorem and its applications ⋮ On the existence and computation of an equilibrium in an economy with constant returns to scale production

Cites Work

• Unnamed Item
• The Computation of General Equilibrium in Economies with a Block Diagonal Pattern
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
• Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
• An improvement of fixed point algorithms by using a good triangulation
• A class of simplicial restart fixed point algorithms without an extra dimension
• The octahedral algorithm, a new simplicial fixed point algorithm
• A Decomposition Algorithm for General Equilibrium Computation with Application to International Trade Models
• On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
• A modification of scarf's algorithm allowing restarting
• Improving the convergence of fixed-point algorithms
• A restart algorithm for computing fixed points without an extra dimension
• The Approximation of Fixed Points of a Continuous Mapping

This page was built for publication: A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices