Towards polynomial simplex-like algorithms for market equilibria

DOI10.1137/1.9781611973105.89MaRDI QIDQ5741798zbMATH OpenOpenAlexFDO

Authors

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973105.89

Mathematics Subject Classification ID

Approximation algorithms (68W25) Analysis of algorithms (68W40) Special types of economic equilibria (91B52)

Recommendations

• A simplex-like algorithm for Fisher markets
• A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
• Market equilibrium via a primal-dual algorithm for a convex program
• Improved algorithms for computing Fisher's market clearing prices
• A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities

Cited in

(10)

• Welfare maximization with production costs: a primal dual approach
• Markets are efficient if and only if P = NP
• scientific article; zbMATH DE number 6004856 (Why is no real title available?)
• A simplex-like algorithm for Fisher markets
• A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
• Polyhedral complementarity on a simplex. Potentiality of regular mappings
• Ascending-price algorithms for unknown markets
• Polyhedral complementarity on a simplex: search for fixed points of decreasing regular mappings
• A Polynomial Time Algorithm for Computing an Arrow–Debreu Market Equilibrium for Linear Utilities
• An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon

This page was built for publication: Towards polynomial simplex-like algorithms for market equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741798)