IDEAS home Printed from https://ideas.repec.org/p/yor/yorken/13-13.html
   My bibliography  Save this paper

Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items

Author

Listed:
  • Kazuo Murota
  • Akiyoshi Shioura
  • Zaifu Yang

Abstract

We address the problem of computing a Walrasian equilibrium price in an ascending auction with gross substitutes valuations. In particular, an auction market is considered where there are multiple differentiated goods and each good may have multiple units. Although the ascending auction is known to ï¬ nd an equilibrium price vector in ï¬ nite time, little is known about its time complexity. The main aim of this paper is to analyze the time complexity of the ascending auction globally and locally, by utilizing the theory of discrete convex analysis. An exact bound on the number of iterations is given in terms of the L infinity distance between the initial price vector and an equilibrium, and an efficient algorithm to update a price vector is designed based on a min-max theorem for submodular function minimization.

Suggested Citation

  • Kazuo Murota & Akiyoshi Shioura & Zaifu Yang, 2013. "Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items," Discussion Papers 13/13, Department of Economics, University of York.
    • Handle: RePEc:yor:yorken:13/13
    as

    Download full text from publisher

    File URL: https://www.york.ac.uk/media/economics/documents/discussionpapers/2013/1313.pdf
    File Function: Main text
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Elizabeth Baldwin & Paul W. Goldberg & Paul Klemperer & Edwin Lock, 2019. "Solving Strong-Substitutes Product-Mix Auctions," Economics Papers 2019-W08, Economics Group, Nuffield College, University of Oxford.
    2. Kojima, Fuhito & Tamura, Akihisa & Yokoo, Makoto, 2018. "Designing matching mechanisms under constraints: An approach from discrete convex analysis," Journal of Economic Theory, Elsevier, vol. 176(C), pages 803-833.

    More about this item

    Keywords

    Dynamic auction; gross substitutes; equilibrium; complexity;
    All these keywords.

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:yor:yorken:13/13. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Paul Hodgson (email available below). General contact details of provider: https://edirc.repec.org/data/deyoruk.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.