IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v141y2023icp223-260.html
   My bibliography  Save this article

Fisher markets with linear constraints: Equilibrium properties and efficient distributed algorithms

Author

Listed:
  • Jalota, Devansh
  • Pavone, Marco
  • Qi, Qi
  • Ye, Yinyu

Abstract

The Fisher market is one of the most fundamental models for resource allocation. However, Fisher markets are less amenable for resource allocation settings when agents have additional linear constraints beyond the budget constraints of buyers and the capacity constraints of goods. Thus, in this work, we introduce a modified Fisher market, where agents may have additional linear constraints, and study the properties of the resulting equilibria. To set equilibrium prices, we introduce a budget-adjusted social optimization problem (BA-SOP), whose optimal dual variables correspond to the equilibrium prices. Since solving BA-SOP can be computationally intensive and requires centralized knowledge of all agents' utilities, we propose a new class of distributed algorithms based on the Alternating Direction Method of Multipliers (ADMM) to compute equilibrium prices. Our ADMM approach has strong convergence guarantees and provides a general-purpose method for computing market equilibria for Fisher markets with homogeneous linear constraints and classical Fisher markets.

Suggested Citation

  • Jalota, Devansh & Pavone, Marco & Qi, Qi & Ye, Yinyu, 2023. "Fisher markets with linear constraints: Equilibrium properties and efficient distributed algorithms," Games and Economic Behavior, Elsevier, vol. 141(C), pages 223-260.
  • Handle: RePEc:eee:gamebe:v:141:y:2023:i:c:p:223-260
    DOI: 10.1016/j.geb.2023.06.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825623000891
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.geb.2023.06.007?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 search for a different version of it.

    References listed on IDEAS

    as
    1. William C. Brainard & Herbert E. Scarf, 2005. "How to Compute Equilibrium Prices in 1891," American Journal of Economics and Sociology, Wiley Blackwell, vol. 64(1), pages 57-83, January.
    2. Cheung, Yun Kuen & Cole, Richard & Devanur, Nikhil R., 2020. "Tatonnement beyond gross substitutes? Gradient descent to the rescue," Games and Economic Behavior, Elsevier, vol. 123(C), pages 295-326.
    3. Mohammad Akbarpour & Afshin Nikzad, 2020. "Approximate Random Allocation Mechanisms," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 87(6), pages 2473-2510.
    4. Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061-1103.
    5. Vijay V. Vazirani, 2010. "Spending Constraint Utilities with Applications to the Adwords Market," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 458-478, May.
    6. Robert T. Jensen & Nolan H. Miller, 2008. "Giffen Behavior and Subsistence Consumption," American Economic Review, American Economic Association, vol. 98(4), pages 1553-1577, September.
    7. Thành Nguyen & Rakesh Vohra, 2019. "Stable Matching with Proportionality Constraints," Operations Research, INFORMS, vol. 67(6), pages 1503-1519, November.
    8. David M. Kreps, 2012. "Microeconomic Foundations I: Choice and Competitive Markets," Economics Books, Princeton University Press, edition 1, volume 1, number 9890.
    9. Itai Ashlagi & Amin Saberi & Ali Shameli, 2020. "Assignment Mechanisms Under Distributional Constraints," Operations Research, INFORMS, vol. 68(2), pages 467-479, March.
    10. Yurii Nesterov & Vladimir Shikhman, 2018. "Computation of Fisher-Gale equilibrium by auction," LIDAM Reprints CORE 2972, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. Fragiadakis, Daniel & Troyan, Peter, 2017. "Improving matching under hard distributional constraints," Theoretical Economics, Econometric Society, vol. 12(2), May.
    12. Hylland, Aanund & Zeckhauser, Richard, 1979. "The Efficient Allocation of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 87(2), pages 293-314, April.
    13. Eric Budish & Yeon-Koo Che & Fuhito Kojima & Paul Milgrom, 2013. "Designing Random Allocation Mechanisms: Theory and Applications," American Economic Review, American Economic Association, vol. 103(2), pages 585-623, April.
    Full references (including those not matched with items on IDEAS)

    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. Ortega, Josué, 2020. "Multi-unit assignment under dichotomous preferences," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
    2. Orhan Aygun & Bertan Turhan, 2020. "Designing Direct Matching Mechanism for India with Comprehensive Affirmative Action," Papers 2004.13264, arXiv.org, revised Dec 2021.
    3. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    4. Marta Boczoń & Alistair J. Wilson, 2023. "Goals, Constraints, and Transparently Fair Assignments: A Field Study of Randomization Design in the UEFA Champions League," Management Science, INFORMS, vol. 69(6), pages 3474-3491, June.
    5. Aziz, Haris & Brandl, Florian, 2022. "The vigilant eating rule: A general approach for probabilistic economic design with constraints," Games and Economic Behavior, Elsevier, vol. 135(C), pages 168-187.
    6. Haris Aziz & Florian Brandl, 2020. "The Vigilant Eating Rule: A General Approach for Probabilistic Economic Design with Constraints," Papers 2008.08991, arXiv.org, revised Jul 2021.
    7. Thanh Nguyen & Ahmad Peivandi & Rakesh Vohra, 2014. "One-Sided Matching with Limited Complementarities," PIER Working Paper Archive 14-030, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    8. Priyanka Shende, 2020. "Constrained Serial Rule on the Full Preference Domain," Papers 2011.01178, arXiv.org.
    9. Aygün, Orhan & Turhan, Bertan, 2021. "How to De-reserve Reserves," ISU General Staff Papers 202103100800001123, Iowa State University, Department of Economics.
    10. Parag A. Pathak & Alex Rees-Jones & Tayfun Sönmez, 2020. "Immigration Lottery Design: Engineered and Coincidental Consequences of H-1B Reforms," NBER Working Papers 26767, National Bureau of Economic Research, Inc.
    11. Hafalir, Isa E. & Kojima, Fuhito & Yenmez, M. Bumin, 2022. "Interdistrict school choice: A theory of student assignment," Journal of Economic Theory, Elsevier, vol. 201(C).
    12. Nikhil Agarwal & Eric Budish, 2021. "Market Design," NBER Working Papers 29367, National Bureau of Economic Research, Inc.
    13. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
    14. Onur Kesten & Morimitsu Kurino & Alexander S. Nesterov, 2017. "Efficient lottery design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 31-57, January.
    15. Paul Gölz & Dominik Peters & Ariel Procaccia, 2022. "In This Apportionment Lottery, the House Always Wins," Post-Print hal-03834513, HAL.
    16. Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
    17. Mehdi Feizi, 2023. "The object allocation problem with favoring upper ranks," International Journal of Economic Theory, The International Society for Economic Theory, vol. 19(2), pages 370-383, June.
    18. Chatterji, Shurojit & Liu, Peng, 2020. "Random assignments of bundles," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 15-30.
    19. He, Yinghua & Li, Sanxi & Yan, Jianye, 2015. "Evaluating assignment without transfers: A market perspective," Economics Letters, Elsevier, vol. 133(C), pages 40-44.
    20. Hashimoto, Tadashi, 2018. "The generalized random priority mechanism with budgets," Journal of Economic Theory, Elsevier, vol. 177(C), pages 708-733.

    More about this item

    Keywords

    Fisher market; Market equilibrium; Resource allocation; Distributed algorithms;
    All these keywords.

    JEL classification:

    • D50 - Microeconomics - - General Equilibrium and Disequilibrium - - - General
    • D11 - Microeconomics - - Household Behavior - - - Consumer Economics: Theory
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market 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:gamebe:v:141:y:2023:i:c:p:223-260. 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/inca/622836 .

    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.