# A Strongly Polynomial Algorithm for Linear Exchange Markets

@article{Garg2018ASP, title={A Strongly Polynomial Algorithm for Linear Exchange Markets}, author={Jugal Garg and L{\'a}szl{\'o} A. V{\'e}gh}, journal={CoRR}, year={2018}, volume={abs/1809.06266} }

- Published in ArXiv 2018

We present a strongly polynomial algorithm for computing an equilibrium in Arrow-Debreu exchange markets with linear utilities. The main measure of progress is identifying a set of edges that must correspond to best bang-per-buck ratios in every equilibrium, called the revealed edge set. We use a variant of the combinatorial algorithm by Duan and Mehlhorn [12] to identify a new revealed edge in a strongly polynomial number of iterations. Every time a new edge is found, we use a subroutine to… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 44 REFERENCES

## A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## A faster strongly polynomial minimum cost flow algorithm

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## A Rational Convex Program for Linear Arrow-Debreu Markets

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Market equilibrium via a primal-dual algorithm for a convex program

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## EXISTENCE OF AN EQUILIBRIUM FOR A COMPETITIVE ECONOMY

VIEW 2 EXCERPTS

HIGHLY INFLUENTIAL

#### Similar Papers

Loading similar papers…