Application of M-convex submodular flow problem to mathematical economics

DOI10.1007/BF03167422zbMath1092.91058OpenAlexW2070580226MaRDI QIDQ1433504

Kazuo Murota, Akihisa Tamura

Publication date: 18 June 2004

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03167422

zbMATH Keywords

competitive equilibriaindivisibility

Mathematics Subject Classification ID

Combinatorial optimization (90C27) General equilibrium theory (91B50)

Related Items

Strategyproof allocation mechanisms with endowments and M-convex distributional constraints, Randomized algorithms for finding the shortest negative cost cycle in networks, An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint, Designing matching mechanisms under constraints: an approach from discrete convex analysis, Conjugacy relationship between M-convex and L-convex functions in continuous variables, Applications of discrete convex analysis to mathematical economics, Coordinatewise domain scaling algorithm for M-convex function minimization, A capacity scaling algorithm for M-convex submodular flow, Computing Walrasian equilibria: fast algorithms and structural properties, Multiple Exchange Property for M^♮-Concave Functions and Valuated Matroids, Competitive Equilibrium and Trading Networks: A Network Flow Approach, Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints, A survey of fundamental operations on discrete convex functions of various kinds, On basic operations related to network induction of discrete convex functions

Cites Work

• Unnamed Item
• Unnamed Item
• Convexity and Steinitz's exchange property
• Equilibrium in a discrete exchange economy with money
• Core and competitive equilibria with indivisibilities
• The existence and computation of competitive equilibria in markets with an indivisible commodity
• Generalized polymatroids and submodular flows
• Submodular flow problem with a nonseparable cost function
• The central assignment game and the assignment markets
• Submodular functions and optimization
• Valuated matroids
• Discrete convex analysis
• Buying several indivisible goods
• Walrasian equilibrium with gross substitutes
• Existence of an equilibrium in a competitive economy with indivisibilities and money
• Competitive equilibrium in an exchange economy with indivisibilities
• New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
• Equilibrium in an exchange economy with multiple indivisible commodities and money
• Notes on L-/M-convex functions and the separation theorems
• Extension of M-convexity and L-convexity to polyhedral convex functions
• On cores and indivisibility
• The assignment game. I: The core
• M-Convex Function on Generalized Polymatroid
• Job Matching, Coalition Formation, and Gross Substitutes
• Discrete Convex Analysis
• Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
• Convex Analysis
• Indivisibilites dans une Economie d'Echanges
• A Note on Kelso and Crawford's Gross Substitutes Condition
• Matrices and matroids for systems analysis
• Discrete convexity and equilibria in economies with indivisible goods and money
• Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.