A simplex-like algorithm for linear Fisher markets
DSpace at IIT Bombay
View Archive InfoField | Value | |
Title |
A simplex-like algorithm for linear Fisher markets
|
|
Creator |
ADSUL, B
BABU, CS GARG, J MEHTA, R SOHONI, M |
|
Subject |
Convex optimization
Fisher market model market equilibrium simplex-like algorithm EQUILIBRIUM POINTS EXISTENCE |
|
Description |
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 nonlinear; however, 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 algorithm which is provably strongly polynomial for many special cases. The algorithm can also be interpreted as a complementary pivot algorithm resembling the classical Lemke-Howson algorithm for computing Nash equilibrium of two-person bimatrix games.
|
|
Publisher |
INDIAN ACAD SCIENCES
|
|
Date |
2014-10-17T06:05:09Z
2014-10-17T06:05:09Z 2012 |
|
Type |
Article
|
|
Identifier |
CURRENT SCIENCE, 103(9)1033-1042
http://dspace.library.iitb.ac.in/jspui/handle/100/16139 |
|
Language |
en
|
|