IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v125y2014i1p18-20.html
   My bibliography  Save this article

A method for finding the maximal set in excess demand

Author

Listed:
  • Andersson, T.
  • Erlanson, A.
  • Gudmundsson, J.
  • Habis, H.
  • Ingebretsen Carlson, J.
  • Kratz, J.

Abstract

We present a polynomial time method for identifying the maximal set in excess demand at a given payoff vector. This set can be used in “large” partnership formation problems to identify the minimum element in the set of individually rational payoff vectors at which there is no overdemanded set of agents. This minimum element corresponds to the minimum Walrasian equilibrium price vector in a special case of the partnership formation problem.

Suggested Citation

  • Andersson, T. & Erlanson, A. & Gudmundsson, J. & Habis, H. & Ingebretsen Carlson, J. & Kratz, J., 2014. "A method for finding the maximal set in excess demand," Economics Letters, Elsevier, vol. 125(1), pages 18-20.
    • Handle: RePEc:eee:ecolet:v:125:y:2014:i:1:p:18-20
    DOI: 10.1016/j.econlet.2014.08.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165176514002948
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.econlet.2014.08.004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. T. Andersson & C. Andersson & A. Talman, 2013. "Sets in excess demand in simple ascending auctions with unit-demand bidders," Annals of Operations Research, Springer, vol. 211(1), pages 27-36, December.
    2. Gerard van der Laan & Zaifu Yang, 2016. "An ascending multi-item auction with financially constrained bidders," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 109-149, December.
    3. Demange, Gabrielle & Gale, David, 1985. "The Strategy Structure of Two-sided Matching Markets," Econometrica, Econometric Society, vol. 53(4), pages 873-888, July.
    4. Pierre-André Chiappori & Alfred Galichon & Bernard Salanié, 2012. "The Roommate Problem is More Stable than You Think," SciencePo Working papers Main hal-03588302, HAL.
    5. Andersson, T.D. & Andersson, C. & Talman, A.J.J., 2010. "Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders," Other publications TiSEM c7482a22-cb73-428b-9cc0-e, Tilburg University, School of Economics and Management.
    6. Andersson, Tommy & Gudmundsson, Jens & Talman, Dolf & Yang, Zaifu, 2014. "A competitive partnership formation process," Games and Economic Behavior, Elsevier, vol. 86(C), pages 165-177.
    7. Talman, Dolf & Yang, Zaifu, 2011. "A model of partnership formation," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 206-212, March.
    8. Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986. "Multi-Item Auctions," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 863-872, August.
    9. Ahmet Alkan & Alparslan Tuncay, 2014. "Pairing Games and Markets," Working Papers 2014.48, Fondazione Eni Enrico Mattei.
    10. repec:hal:spmain:info:hdl:2441/3sd5loegec9d3o795888da61tp is not listed on IDEAS
    11. Sankaran, Jayaram K., 1994. "On a dynamic auction mechanism for a bilateral assignment problem," Mathematical Social Sciences, Elsevier, vol. 28(2), pages 143-150, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Akiyoshi Shioura, 2017. "On the Partnership formation problem," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 105-140, December.
    2. Jens Gudmundsson, 2014. "Sequences in Pairing Problems: A new approach to reconcile stability with strategy-proofness for elementary matching problems," 2014 Papers pgu351, Job Market Papers.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andersson, Tommy & Gudmundsson, Jens & Talman, Dolf & Yang, Zaifu, 2014. "A competitive partnership formation process," Games and Economic Behavior, Elsevier, vol. 86(C), pages 165-177.
    2. Akiyoshi Shioura, 2017. "On the Partnership formation problem," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 105-140, December.
    3. Ingebretsen Carlson, Jim, 2015. "An Approximate Auction," Working Papers 2015:19, Lund University, Department of Economics.
    4. David Pérez-Castrillo & Marilda Sotomayor, 2023. "Constrained-optimal tradewise-stable outcomes in the one-sided assignment game: a solution concept weaker than the core," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(3), pages 963-994, October.
    5. Ingebretsen Carlson, Jim, 2016. "An Auction with Approximated Bidder Preferences - When an Auction has to be Quick," Working Papers 2016:12, Lund University, Department of Economics.
    6. Andersson, Tommy & Yang, Zaifu & Zhang, Dongmo, 2015. "How to efficiently allocate houses under price controls?," Economics Letters, Elsevier, vol. 130(C), pages 97-99.
    7. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    8. Jens Gudmundsson, 2014. "Sequences in Pairing Problems: A new approach to reconcile stability with strategy-proofness for elementary matching problems," 2014 Papers pgu351, Job Market Papers.
    9. Gudmundsson, Jens, 2013. "Cycles and Third-Party Payments in the Partnership Formation Problem," Working Papers 2013:16, Lund University, Department of Economics.
    10. , & ,, 2015. "Strategy-proofness and efficiency with non-quasi-linear preferences: a characterization of minimum price Walrasian rule," Theoretical Economics, Econometric Society, vol. 10(2), May.
    11. Gerard van der Laan & Zaifu Yang, 2016. "An ascending multi-item auction with financially constrained bidders," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 109-149, December.
    12. Mishra, Debasis & Talman, Dolf, 2010. "Characterization of the Walrasian equilibria of the assignment model," Journal of Mathematical Economics, Elsevier, vol. 46(1), pages 6-20, January.
    13. Tierney, Ryan, 2019. "The problem of multiple commons: A market design approach," Games and Economic Behavior, Elsevier, vol. 114(C), pages 1-27.
    14. Zhou, Yu, 2017. "A multi-item auction with budget-constrained bidders and price controls," Economics Letters, Elsevier, vol. 155(C), pages 76-79.
    15. Manjunath, Vikram, 2016. "Fractional matching markets," Games and Economic Behavior, Elsevier, vol. 100(C), pages 321-336.
    16. Kazuo Murota & Akiyoshi Shioura & Zaifu Yang, 2014. "Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis," Discussion Papers 14/27, Department of Economics, University of York.
    17. Tommy Andersson & Christer Andersson, 2012. "Properties of the DGS-Auction Algorithm," Computational Economics, Springer;Society for Computational Economics, vol. 39(2), pages 113-133, February.
    18. Gudmundsson, Jens, 2011. "On symmetry in the formation of stable partnerships," Working Papers 2011:29, Lund University, Department of Economics.
    19. A. Talman & Zaifu Yang, 2015. "An efficient multi-item dynamic auction with budget constrained bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
    20. Bikhchandani, Sushil & Ostroy, Joseph M., 2002. "The Package Assignment Model," Journal of Economic Theory, Elsevier, vol. 107(2), pages 377-406, December.

    More about this item

    Keywords

    Partnership formation; Polynomial time method; Excess demand;
    All these keywords.

    JEL classification:

    • C6 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling
    • D4 - Microeconomics - - Market Structure, Pricing, and Design

    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:eee:ecolet:v:125:y:2014:i:1:p:18-20. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ecolet .

    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.