A simplex-like algorithm for Fisher markets
From MaRDI portal
Recommendations
- Towards polynomial simplex-like algorithms for market equilibria
- A simple and efficient algorithm for computing market equilibria
- On Equilibrium Pricing as Convex Optimization
- Market equilibrium via a primal-dual algorithm for a convex program
- Improved algorithms for computing Fisher's market clearing prices
Cites work
Cited in
(10)- How to allocate goods in an online market?
- An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon
- Rationality and strongly polynomial solvability of Eisenberg-Gale markets with two agents
- Approximation of the Fisher Price index by using the Lloyd–Moulton index: Simulation study
- Nash equilibria in Fisher market
- Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms
- Towards polynomial simplex-like algorithms for market equilibria
- Infinite-Dimensional Fisher Markets and Tractable Fair Division
- Polyhedral complementarity on a simplex: search for fixed points of decreasing regular mappings
- An alternating algorithm for finding linear Arrow-Debreu market equilibria
This page was built for publication: A simplex-like algorithm for Fisher markets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3162504)