IDEAS home Printed from https://ideas.repec.org/a/jmi/articl/jmi-v2i1a4.html
   My bibliography  Save this article

On the Partnership formation problem

Author

Listed:
  • Akiyoshi Shioura

    (Tokyo Institute of Technology, Japan)

Abstract

In this paper we re-examine the partnership formation problem, which is a generalization of the classical assignment game. We show that the former problem can be transformed into the latter one in some sense; more precisely, we demonstrate that using an equilibrium in an associated assignment game, we can find an equilibrium in the partnership formation problem if it exists. Based on this, we devise an algorithm to compute an equilibrium of the partnership formation problem, and show that the proposed algorithm can be seen as a variant of the one by Andersson et al. (2014b).

Suggested Citation

  • 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.
  • Handle: RePEc:jmi:articl:jmi-v2i1a4
    DOI: 10.22574/jmid.2017.12.004
    as

    Download full text from publisher

    File URL: http://www.mechanism-design.org/arch/v002-1/p_04.pdf
    Download Restriction: no

    File URL: https://libkey.io/10.22574/jmid.2017.12.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
    ---><---

    References listed on IDEAS

    as
    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. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    3. 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.
    4. Johan Karlander & Kimmo Eriksson, 2001. "Stable outcomes of the roommate game with transferable utility," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(4), pages 555-569.
    5. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    6. Talman, Dolf & Yang, Zaifu, 2011. "A model of partnership formation," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 206-212, March.
    7. 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.
    8. 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.
    9. Crawford, Vincent P & Knoer, Elsie Marie, 1981. "Job Matching with Heterogeneous Firms and Workers," Econometrica, Econometric Society, vol. 49(2), pages 437-450, March.
    10. Andersson, Tommy & Andersson, Christer & Talman, Adolphus Johannes Jan, 2010. "Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders," Working Papers 2010:15, Lund University, Department of Economics, revised 28 Jun 2012.
    11. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
    12. Mishra, Debasis & Parkes, David C., 2009. "Multi-item Vickrey-Dutch auctions," Games and Economic Behavior, Elsevier, vol. 66(1), pages 326-347, May.
    13. Péter Biró & Walter Kern & Daniël Paulusma, 2012. "Computing solutions for matching games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 75-90, February.
    14. Pierre-André Chiappori & Alfred Galichon & Bernard Salanié, 2012. "The Roommate Problem is More Stable than You Think," SciencePo Working papers Main hal-03588302, HAL.
    15. Bettina Klaus & Alexandru Nichifor, 2010. "Consistency in one-sided assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 35(3), pages 415-433, 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. 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.
    3. Ingebretsen Carlson, Jim, 2015. "An Approximate Auction," Working Papers 2015:19, Lund University, Department of Economics.
    4. 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.
    5. Gudmundsson, Jens, 2013. "Cycles and Third-Party Payments in the Partnership Formation Problem," Working Papers 2013:16, 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. 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.
    8. 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.
    9. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    10. 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.
    11. Talman, Dolf & Yang, Zaifu, 2011. "A model of partnership formation," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 206-212, March.
    12. 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.
    13. 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.
    14. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    15. De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
    16. 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.
    17. Ahmet Alkan & Alparslan Tuncay, 2014. "Pairing Games and Markets," Working Papers 2014.48, Fondazione Eni Enrico Mattei.
    18. Satoru Fujishige & Zaifu Yang, 2017. "On a spontaneous decentralized market process," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 1-37, December.
    19. Pierre-André Chiappori & Alfred Galichon & Bernard Salanié, 2012. "The Roommate Problem is More Stable than You Think," Working Papers hal-03588302, HAL.
    20. Yokote, Koji, 2017. "Application of the discrete separation theorem to auctions," MPRA Paper 82884, University Library of Munich, Germany.

    More about this item

    Keywords

    Partnership formation; equilibrium; assignment game; adjustment process.;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • 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:jmi:articl:jmi-v2i1a4. 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: Paul Schweinzer (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.