Computation of Fisher–Gale Equilibrium by Auction

创建日期:  2018/10/09  王婧   浏览次数:   返回

刊名:Journal of the Operations Research Society of China
题名:Computation of Fisher–Gale Equilibrium by Auction
June 2018, Volume 6, Issue 3, pp349-389
作者: Yurii Nesterov, Vladimir Shikhman
单位:Catholic University of Louvain, National Research University Higher School of Economics, Technische Universität Chemnitz    
摘要:We study the Fisher model of a competitive market from the algorithmic perspective. For that, the related convex optimization problem due to Gale and Eisenberg (Ann Math Stat 30(1):165–168, 1959) is used. The latter problem is known to yield a Fisher equilibrium under some structural assumptions on consumers’ utilities, e.g., homogeneity of degree 1, homotheticity. Our goal is to examine applicability of the convex optimization framework by departing from these traditional assumptions. We just assume the concavity of consumers’ utility functions. For this case, we suggest a novel concept of Fisher–Gale equilibrium by using consumers’ utility prices. The prices of utility transfer the utility of consumption bundle to a common numéraire. We develop a subgradient-type algorithm from Convex Analysis to compute a Fisher–Gale equilibrium via Gale’s approach. In order to decentralize prices, we additionally implement the auction design, i.e., consumers settle and update their individual prices and producers sell at the highest offer price. Our price adjustment is based on a tatonnement procedure, i.e., the prices change proportionally to consumers’ individual excess supplies. Historical averages of consumption are shown to clear the market of goods. Our algorithm is justified by a global rate of convergence. In the worst case, the number of price updates needed to achieve an ε -tolerance is proportional to1/ε2 .
关键词:Fisher equilibrium · Computation of equilibrium · Price adjustment ·
Convex optimization · Subgradient methods · Decentralization of prices · Auction
全文链接https://link.springer.com/article/10.1007/s40305-018-0195-5

上一条:基于5×5邻域像素点相关性的划痕修复算法

下一条:Convex Analysis and Duality over Discrete Domains

 版权所有 © 上海大学   沪ICP备09014157   沪公网安备31009102000049号  地址:上海市宝山区上大路99号    邮编:200444   电话查询
 技术支持:上海大学信息化工作办公室   联系我们  

办公地址:上海市宝山区南陈路333号上海大学东区三号楼二楼   联系电话:021-66132736