An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market

@article{Duan2016AnIC,
  title={An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market},
  author={Ran Duan and Jugal Garg and Kurt Mehlhorn},
  journal={ArXiv},
  year={2016},
  volume={abs/1510.02694}
}
We present an improved combinatorial algorithm for the computation of equilibrium prices in the linear ArrowDebreu model. For a market with n agents and integral utilities bounded by U , the algorithm runs in O(n log(nU)) time. This improves upon the previously best algorithm of Ye by a factor of Ω̃(n). The algorithm refines the algorithm described by Duan and Mehlhorn and improves it by a factor of Ω̃(n). The improvement comes from a better understanding of the iterative price adjustment… CONTINUE READING
3
Twitter Mentions

Similar Papers

Figures and Topics from this paper.

References

Publications referenced by this paper.