# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

##### MPS-Authors

##### Locator

There are no locators available

##### Fulltext (public)

There are no public fulltexts available

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Duan, R., Garg, J., & Mehlhorn, K. (2016). An Improved Combinatorial Polynomial
Algorithm for the Linear Arrow-Debreu Market. In R. Krauthgamer (*Proceedings
of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms* (pp. 90-106). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974331.ch7.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0028-81DD-9

##### Abstract

We present an improved combinatorial algorithm for the computation of equilibrium prices in the linear Arrow-Debreu model. For a market with $n$ agents and integral utilities bounded by $U$, the algorithm runs in $O(n^7 \log^3 (nU))$ time. This improves upon the previously best algorithm of Ye by a factor of $\tOmega(n)$. The algorithm refines the algorithm described by Duan and Mehlhorn and improves it by a factor of $\tOmega(n^3)$. The improvement comes from a better understanding of the iterative price adjustment process, the improved balanced flow computation for nondegenerate instances, and a novel perturbation technique for achieving nondegeneracy.