A Note on Kelso and Crawford's Gross Substitutes Condition
From MaRDI portal
Publication:5704136
DOI10.1287/moor.28.3.463.16393zbMath1082.91054OpenAlexW2021907424MaRDI QIDQ5704136
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.28.3.463.16393
equilibriumsubmodular functionindivisibilitygeneralized polymatroidgross substitutes\(M^{\natural}\)-concave function
Applications of mathematical programming (90C90) Minimax problems in mathematical programming (90C47) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
Independence systems in gross-substitute valuations, Dual greedy polyhedra, choice functions, and abstract convex geometries, Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function, Logarithmic concavity for morphisms of matroids, Counting combinatorial choice rules, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Matching with partially ordered contracts, Matroid rank functions and discrete concavity, Gross substitutability: an algorithmic survey, A critical comparison between the gross substitutes and complements conditions, Walrasian equilibria from an optimization perspective: A guide to the literature, Identifying combinatorial valuations from aggregate demand, A Note on a Two-Sided Discrete-Concave Market with Possibly Bounded Salaries, On the Construction of Substitutes, Equivalence between substitutability and \(\mathrm{M}^\natural\)-concavity for set functions under discrete transfers, Characterization and algorithm for bivariate multi-unit assignment valuations, Testing substitutability, New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities., Demand-flow of agents with gross-substitute valuations, Application of M-convex submodular flow problem to mathematical economics, Antimatroids induced by matchings, Consistency of the doctor-optimal equilibrium price vector in job-matching markets, Valuated matroid-based algorithm for submodular welfare problem, Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions, Simpler exchange axioms for M-concave functions on generalized polymatroids, Core and competitive equilibria: an approach from discrete convex analysis, Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions, Time bounds for iterative auctions: a unified approach by discrete convex analysis, Buyback problem with discrete concave valuation functions, Designing matching mechanisms under constraints: an approach from discrete convex analysis, Nash implementation of competitive equilibria in the job-matching market, Applications of discrete convex analysis to mathematical economics, Walrasian's characterization and a universal ascending auction, A general two-sided matching market with discrete concave utility functions, Coordinatewise domain scaling algorithm for M-convex function minimization, Combinatorial auctions with decreasing marginal utilities, Geometry of gross substitutes valuations, Computing Walrasian equilibria: fast algorithms and structural properties, The Finite Matroid-Based Valuation Conjecture is False, The discrete separation theorem and price adjustment directions in markets with heterogeneous commodities, Multiple Exchange Property for M♮-Concave Functions and Valuated Matroids, ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS, Competitive Equilibrium and Trading Networks: A Network Flow Approach, Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints, On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market, Market Pricing for Matroid Rank Valuations, Substitutes and complements in network flows viewed as discrete convexity
