In this work, we study a generalized Fisher market model that incorporates social influence. In this extended model, buyers’ utilities depend not only on their own resource allocation but also on the allocations received by their competitors. We propose a novel competitive equilibrium formulation for this generalized Fisher market using a variational inequality approach. This framework effectively captures competitive equilibrium in markets that extend beyond the traditional assumption of homogeneous utility functions. We analyze key structural properties of the proposed variational inequality problem, including monotonicity, stability, and uniqueness. Additionally, we present two decentralized learning algorithms for buyers to achieve competitive equilibrium: a two-timescale stochastic approximation-based tâtonnement method and a trading-post mechanism-based learning method. Finally, we validate the proposed algorithms through numerical simulations.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On Stability and Learning of Competitive Equilibrium in Generalized Fisher Market Models: A Variational Inequality Approach

  • Mandar Datar

摘要

In this work, we study a generalized Fisher market model that incorporates social influence. In this extended model, buyers’ utilities depend not only on their own resource allocation but also on the allocations received by their competitors. We propose a novel competitive equilibrium formulation for this generalized Fisher market using a variational inequality approach. This framework effectively captures competitive equilibrium in markets that extend beyond the traditional assumption of homogeneous utility functions. We analyze key structural properties of the proposed variational inequality problem, including monotonicity, stability, and uniqueness. Additionally, we present two decentralized learning algorithms for buyers to achieve competitive equilibrium: a two-timescale stochastic approximation-based tâtonnement method and a trading-post mechanism-based learning method. Finally, we validate the proposed algorithms through numerical simulations.