We propose a new convex optimization formulation for the Fisher market problem with linear utilities. Like the Eisenberg-Gale formulation, the set of feasible points is a polyhedral convex set while the cost function is non-linear; however, unlike that, the optimum is always attained at a vertex of this polytope. The convex cost function depends only on the initial endowments of the buyers. This formulation yields an easy simplex-like pivoting algorithm which is provably strongly polynomial for many special cases. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Adsul, B., Babu, C. S., Garg, J., Mehta, R., & Sohoni, M. (2010). A simplex-like algorithm for fisher markets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6386 LNCS, pp. 18–29). https://doi.org/10.1007/978-3-642-16170-4_3
Mendeley helps you to discover research relevant for your work.