Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/xmlui/handle/100/2039
Title: A simplex-like algorithm for fisher markets
Authors: ADSUL, B
BABU, CS
GARG, J
MEHTA, R
SOHONI, M
Issue Date: 2010
Publisher: SPRINGER-VERLAG BERLIN
Citation: ALGORITHMIC GAME THEORY,6386,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.
URI: http://dspace.library.iitb.ac.in/xmlui/handle/10054/15314
http://hdl.handle.net/100/2039
ISBN: 978-3-642-16169-8
ISSN: 0302-9743
Appears in Collections:Proceedings papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.