Header menu link for other important links
X
A simplex-like algorithm for fisher markets
B. Adsul, , J. Garg, R. Mehta, M. Sohoni
Published in
2010
Volume: 6386 LNCS
   
Issue: M4D
Pages: 18 - 29
Abstract
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.
About the journal
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN03029743