IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v229y2015i1p565-59010.1007-s10479-015-1835-3.html
   My bibliography  Save this article

Valuated matroid-based algorithm for submodular welfare problem

Author

Listed:
  • Takanori Maehara
  • Kazuo Murota

Abstract

An algorithm for the submodular welfare problem is proposed based on the theory of discrete convex analysis. The proposed algorithm is a heuristic method built upon the valuated matroid partition algorithms, and gives the exact optimal solution for a reasonable subclass of submodular welfare problems. The algorithm has a guaranteed approximation ratio for a special case. Computational results show fairly good performance of the proposed algorithm. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Takanori Maehara & Kazuo Murota, 2015. "Valuated matroid-based algorithm for submodular welfare problem," Annals of Operations Research, Springer, vol. 229(1), pages 565-590, June.
    • Handle: RePEc:spr:annopr:v:229:y:2015:i:1:p:565-590:10.1007/s10479-015-1835-3
    DOI: 10.1007/s10479-015-1835-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-015-1835-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-015-1835-3?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. Yann Chevaleyre & Ulle Endriss & Sylvia Estivie & Nicolas Maudet, 2008. "Multiagent resource allocation in k-additive domains: preference representation and complexity," Annals of Operations Research, Springer, vol. 163(1), pages 49-62, October.
    2. Bevia, Carmen & Quinzii, Martine & Silva, Jose A., 1999. "Buying several indivisible goods," Mathematical Social Sciences, Elsevier, vol. 37(1), pages 1-23, January.
    3. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    4. Lehmann, Benny & Lehmann, Daniel & Nisan, Noam, 2006. "Combinatorial auctions with decreasing marginal utilities," Games and Economic Behavior, Elsevier, vol. 55(2), pages 270-296, May.
    5. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Gul, Faruk & Stacchetti, Ennio, 1999. "Walrasian Equilibrium with Gross Substitutes," Journal of Economic Theory, Elsevier, vol. 87(1), pages 95-124, July.
    8. Satoru Fujishige & Zaifu Yang, 2003. "A Note on Kelso and Crawford's Gross Substitutes Condition," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 463-469, August.
    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. Lehmann, Daniel, 2020. "Quality of local equilibria in discrete exchange economies," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 141-152.
    2. Dries R. Goossens & Rudolf Müller & Frits C. R. Spieksma, 2010. "Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 339-352, August.
    3. Akiyoshi Shioura, 2015. "Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 192-225, February.
    4. Zaifu Yang, 2008. "On the Solutions of Discrete Nonlinear Complementarity and Related Problems," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 976-990, November.
    5. Danilov, V. & Koshevoy, G. & Lang, C., 2013. "Equilibria in Markets with Indivisible Goods," Journal of the New Economic Association, New Economic Association, vol. 18(2), pages 10-34.
    6. 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.
    7. Goossens, D.R. & Müller, R.J. & Spieksma, F.C.R., 2007. "Matrix bids in combinatorial auctions: expressiveness and micro-economic properties," Research Memorandum 016, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    8. Ning Sun & Zaifu Yang, 2008. "A Double-Track Auction for Substitutes and Complements," KIER Working Papers 656, Kyoto University, Institute of Economic Research.
    9. Eric Balkanski & Renato Paes Leme, 2020. "On the Construction of Substitutes," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 272-291, February.
    10. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
    11. Kazuo Murota & Yu Yokoi, 2015. "On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 460-473, February.
    12. Yokote, Koji, 2021. "Consistency of the doctor-optimal equilibrium price vector in job-matching markets," Journal of Economic Theory, Elsevier, vol. 197(C).
    13. Kumar, Ujjwal & Roy, Souvik, 2024. "Local incentive compatibility on gross substitutes and other non-convex type-spaces," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    14. Ning Sun & Zaifu Yang, 2014. "An Efficient and Incentive Compatible Dynamic Auction for Multiple Complements," Journal of Political Economy, University of Chicago Press, vol. 122(2), pages 422-466.
    15. Satoru Fujishige & Zaifu Yang, 2002. "Existence of an Equilibrium in a General Competitive Exchange Economy with Indivisible Goods and Money," Annals of Economics and Finance, Society for AEF, vol. 3(1), pages 135-147, May.
    16. Jinpeng Ma & Qiongling Li, 2016. "Convergence of price processes under two dynamic double auctions," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 1-44, December.
    17. Yokote, Koji, 2018. "The discrete Kuhn-Tucker theorem and its application to auctions," MPRA Paper 83811, University Library of Munich, Germany.
    18. Echenique, Federico, 2007. "Counting combinatorial choice rules," Games and Economic Behavior, Elsevier, vol. 58(2), pages 231-245, February.
    19. Simon Bruggmann & Rico Zenklusen, 2019. "Submodular Maximization Through the Lens of Linear Programming," Management Science, INFORMS, vol. 44(4), pages 1221-1244, November.
    20. Roy, Souvik & Kumar, Ujjwal, 2021. "Local incentive compatibility in non-convex type-spaces," MPRA Paper 110872, University Library of Munich, Germany.

    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:spr:annopr:v:229:y:2015:i:1:p:565-590:10.1007/s10479-015-1835-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.