An alternating algorithm for finding linear arrow-debreu market equilibria

Po-An Chen, Chi-Jen Lu, Yu-Sin Lu

    研究成果: Article同行評審

    摘要

    Motivated by the convergence result of mirror-descent algorithms to market equilibria in linear Fisher markets, it is natural for one to consider designing dynamics (specifically, iterative algorithms) for agents to arrive at linear Arrow-Debreu market equilibria. Jain reduced equilibrium computation in linear Arrow-Debreu markets to the equilibrium computation in bijective markets, where everyone is a seller of only one good and a buyer for a bundle of goods. In this paper, we design an algorithm for computing linear bijective market equilibrium, based on solving the rational convex program formulated by Devanur et al. The algorithm repeatedly alternates between a step of gradient-descent-like updates and a distributed step of optimization exploiting the property of such convex program. Convergence can be ensured by a new analysis different from the analysis for linear Fisher market equilibria.
    原文English
    頁數13
    期刊Theory of Computing Systems
    DOIs
    出版狀態Published - 七月 2021

    指紋

    深入研究「An alternating algorithm for finding linear arrow-debreu market equilibria」主題。共同形成了獨特的指紋。

    引用此