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

An assignment model with local constraints: Competitive equilibrium and ascending auction

Author

Listed:
  • Pan, Lijun
  • Peng, Linyu
  • Zhou, Yu

Abstract

We consider an assignment model where each agent has unit-demand quasi-linear preferences and may face some local constraint, i.e., her possible assignment is restricted to a subset of items. Our model takes the assignment models without and with outside options, e.g., Andersson (2007) and Andersson et al. (2013), as special cases. We show that local constraints may lead to the non-existence of competitive equilibrium (CE), and provide a sufficient and necessary condition that ensures its existence. We establish the lattice of CE prices. Besides, an ascending auction is proposed, either finding a CE or validating its non-existence in finitely many steps. It generalizes Andersson et al. (2013)’s auction by adjusting increments stepwise.

Suggested Citation

  • Pan, Lijun & Peng, Linyu & Zhou, Yu, 2020. "An assignment model with local constraints: Competitive equilibrium and ascending auction," Economics Letters, Elsevier, vol. 188(C).
  • Handle: RePEc:eee:ecolet:v:188:y:2020:i:c:s0165176519304562
    DOI: 10.1016/j.econlet.2019.108905
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.econlet.2019.108905?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. 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. Lars-Gunnar Svensson, 2009. "Coalitional strategy-proofness and fairness," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 40(2), pages 227-245, August.
    3. 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.
    4. Andersson, Tommy & Svensson, Lars-Gunnar, 2008. "Non-manipulable assignment of individuals to positions revisited," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 350-354, November.
    5. Mustafa Oǧuz Afacan, 2019. "Matching with restricted trade," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(3), pages 957-977, September.
    6. 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.
    7. Mishra, D. & Talman, A.J.J., 2010. "Characterization of the Walrasian equilibria of the assignment model," Other publications TiSEM 3e249b02-c0f4-4ccf-bd37-f, Tilburg University, School of Economics and Management.
    8. Andersson, Tommy, 2007. "An algorithm for identifying fair and optimal allocations," Economics Letters, Elsevier, vol. 96(3), pages 337-342, September.
    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. 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. , & ,, 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.
    3. Yu Zhou & Shigehiro Serizawa, 2019. "Minimum price equilibrium in the assignment market," ISER Discussion Paper 1047, Institute of Social and Economic Research, The University of Osaka.
    4. Andersson, Tommy & Yang, Zaifu & Zhang, Dongmo, 2015. "How to efficiently allocate houses under price controls?," Economics Letters, Elsevier, vol. 130(C), pages 97-99.
    5. , & , & ,, 2014. "Budget-balance, fairness and minimal manipulability," Theoretical Economics, Econometric Society, vol. 9(3), September.
    6. 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.
    7. 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.
    8. Ingebretsen Carlson, Jim, 2015. "An Approximate Auction," Working Papers 2015:19, Lund University, Department of Economics.
    9. Yokote, Koji, 2017. "Application of the discrete separation theorem to auctions," MPRA Paper 82884, University Library of Munich, Germany.
    10. Tommy Andersson & Christer Andersson, 2009. "Solving House Allocation Problems with Risk-Averse Agents," Computational Economics, Springer;Society for Computational Economics, vol. 33(4), pages 389-401, May.
    11. 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.
    12. Tierney, Ryan, 2019. "The problem of multiple commons: A market design approach," Games and Economic Behavior, Elsevier, vol. 114(C), pages 1-27.
    13. Zhou, Yu & Serizawa, Shigehiro, 2023. "Multi-object auction design beyond quasi-linearity: Leading examples," Games and Economic Behavior, Elsevier, vol. 140(C), pages 210-228.
    14. Yu Zhou & Shigehiro Serizawa, 2020. "Serial Vickrey Mechanism," ISER Discussion Paper 1095, Institute of Social and Economic Research, The University of Osaka.
    15. Andersson, T. & Gudmundsson, J. & Talman, A.J.J. & Yang, Z., 2013. "A Competitive Partnership Formation Process," Other publications TiSEM b5dd75eb-d5be-4788-97b4-f, Tilburg University, School of Economics and Management.
    16. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    17. Jim Ingebretsen Carlson, 2020. "A speedy auction using approximated bidders’ preferences," Annals of Operations Research, Springer, vol. 288(1), pages 65-93, May.
    18. De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
    19. David Pérez-Castrillo & Marilda Sotomayor, 2017. "On the manipulability of competitive equilibrium rules in many-to-many buyer–seller markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 1137-1161, November.
    20. Zhang, Xieji, 2024. "The ascending auction with flexible reporting," Mathematical Social Sciences, Elsevier, vol. 132(C), pages 28-39.

    More about this item

    Keywords

    Assignment model; Local constraints; Competitive equilibrium; Existence; Lattice; Ascending auction;
    All these keywords.

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism 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:188:y:2020:i:c:s0165176519304562. 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.