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}
}
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
4
Twitter Mentions

References

Publications referenced by this paper.
SHOWING 1-10 OF 44 REFERENCES

Similar Papers

Loading similar papers…