b'@inproceedings{DuanSODA2016,'b'\nTITLE = {An Improved Combinatorial Polynomial Algorithm for the Linear {Arrow}-{Debreu} Market},\nAUTHOR = {Duan, Ran and Garg, Jugal and Mehlhorn, Kurt},\nLANGUAGE = {eng},\nISBN = {978-1-61197-433-1},\nDOI = {10.1137/1.9781611974331.ch7},\nPUBLISHER = {SIAM},\nYEAR = {2016},\nDATE = {2016},\nABSTRACT = {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.},\nBOOKTITLE = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016)},\nEDITOR = {Krauthgamer, Robert},\nPAGES = {90--106},\nADDRESS = {Arlington, VA, USA},\n}\n'