Gross substitution, discrete convexity, and submodularity

DOI10.1016/S0166-218X(02)00456-0zbMath1030.90096MaRDI QIDQ1410681

D. Massart

Publication date: 14 October 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Discrete convexity; Submodularity; Gross substitution

Mathematics Subject Classification ID

90C25: Convex programming

90C27: Combinatorial optimization

Related Items

On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market, Identifying combinatorial valuations from aggregate demand, Applications of discrete convex analysis to mathematical economics, Coordinatewise domain scaling algorithm for M-convex function minimization, Matching with partially ordered contracts, Equilibria for pooling situations, A general two-sided matching market with discrete concave utility functions

Cites Work

• Unnamed Item
• Unnamed Item
• Convexity and Steinitz's exchange property
• A note on Frank's generalized polymatroids
• Generalized polymatroids and submodular flows
• Valuated matroids
• Walrasian equilibrium with gross substitutes
• Discrete convexity and unimodularity. I.
• Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2
• M-Convex Function on Generalized Polymatroid
• Job Matching, Coalition Formation, and Gross Substitutes
• Minimizing a Submodular Function on a Lattice
• Discrete convexity and equilibria in economies with indivisible goods and money