Skip to main content

Application of M-Convex Submodular Flow Problem to Mathematical Economics

  • Conference paper
  • First Online:
Book cover Algorithms and Computation (ISAAC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2223))

Included in the following conference series:

Abstract

This paper shows an application of the M-convexs ubmodular flow problem to an economic model in which producers and consumers trade various indivisible commodities through a perfectly divisible commodity, money. We give an efficient algorithm to decide whether a competitive equilibrium exists or not, when cost functions of the producers are M♮-convex and utility functions of the consumers are M♮-concave and quasilinear in money. The algorithm consists of two phases: the first phase computes productions and consumptions in an equilibrium by solving an M-convexs ubmodular flow problem and the second finds an equilibrium price vector by solving a shortest path problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Danilov, G. Koshevoy, and K. Murota, Discrete convexity and equilibria in economies with indivisible goods and money, Math. Social Sci. 41 (2001) 251–273.

    Article  MathSciNet  MATH  Google Scholar 

  2. S. Fujishige and K. Murota, Notes on L-/M-convexfu nctions and the separation theorems, Math. Programming 88 (2000) 129–146.

    Article  MathSciNet  MATH  Google Scholar 

  3. S. Iwata and M. Shigeno, Conjugate scaling algorithm for Fenchel-type duality in discrete convexo ptimization, SIAM J. Optim., to appear.

    Google Scholar 

  4. K. Murota, Convexity and Steinitz’s exchange property, Adv. Math. 124 (1996) 272–311.

    Article  MathSciNet  MATH  Google Scholar 

  5. K. Murota, Discrete convexan alysis, Math. Programming 83 (1998) 313–371.

    MathSciNet  Google Scholar 

  6. K. Murota, Submodular flow problem with a nonseparable cost function, Combinatorica 19 (1999) 87–109.

    Article  MathSciNet  MATH  Google Scholar 

  7. K. Murota, Discrete Convex Analysis(in Japanese) (Kyoritsu-Shuppan, Tokyo) to appear.

    Google Scholar 

  8. K. Murota and A. Shioura, M-convexfu nction on generalized polymatroid, Math. Oper. Res. 24 (1999) 95–105.

    Article  MathSciNet  MATH  Google Scholar 

  9. K. Murota and A. Shioura, Extension of M-convexity and L-convexity to polyhedral convexf unctions, Adv. in Appl. Math. 25 (2000) 352–427.

    Article  MathSciNet  MATH  Google Scholar 

  10. K. Murota and A. Shioura, Relationship of M-/L-convexfu nctions with discrete convexfu nctions by Miller and by Favati-Tardella, Discrete Appl. Math. to appear.

    Google Scholar 

  11. K. Murota and A. Tamura, New characterizations of M-convexfu nctions and their applications to economic equilibrium models with indivisibilities, Discrete Appl.Math., to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Murota, K., Tamura, A. (2001). Application of M-Convex Submodular Flow Problem to Mathematical Economics. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45678-3_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42985-2

  • Online ISBN: 978-3-540-45678-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics