A Note on Kelso and Crawford's Gross Substitutes Condition
From MaRDI portal
(Redirected from Publication:5704136)
Recommendations
- Gross substitutes and endowed assignment valuations
- Equivalence between substitutability and \(\mathrm{M}^\natural\)-concavity for set functions under discrete transfers
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- Gross substitutability: an algorithmic survey
- Gross substitution, discrete convexity, and submodularity
Cited in
(60)- A note on a two-sided discrete-concave market with possibly bounded salaries
- Counting combinatorial choice rules
- Local incentive compatibility on gross substitutes and other non-convex type-spaces
- Efficient and strategy-proof mechanism under general constraints
- Logarithmic concavity for morphisms of matroids
- Applications of discrete convex analysis to mathematical economics
- Market pricing for matroid rank valuations
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
- Identifying combinatorial valuations from aggregate demand
- A NEW CHARACTERIZATION OF M^〓-CONVEX SET FUNCTIONS BY SUBSTITUTABILITY
- Matching with partially ordered contracts
- Antimatroids induced by matchings
- Consistency of the doctor-optimal equilibrium price vector in job-matching markets
- Nash implementation of competitive equilibria in the job-matching market
- The discrete separation theorem and price adjustment directions in markets with heterogeneous commodities
- Monotonicity of extremal Walrasian prices in gross substitutes markets
- Simpler exchange axioms for M-concave functions on generalized polymatroids
- Testing substitutability
- A general two-sided matching market with discrete concave utility functions
- Computing Walrasian equilibria: fast algorithms and structural properties
- Independence systems in gross-substitute valuations
- Gross substitutability: an algorithmic survey
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds
- Buyback problem with discrete concave valuation functions
- Walrasian equilibria from an optimization perspective: A guide to the literature
- Time bounds for iterative auctions: a unified approach by discrete convex analysis
- Gross substitution, discrete convexity, and submodularity
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
- Application of M-convex submodular flow problem to mathematical economics
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- A flow-based ascending auction to compute buyer-optimal Walrasian prices
- A critical comparison between the gross substitutes and complements conditions
- Characterization and algorithm for bivariate multi-unit assignment valuations
- Walrasian's characterization and a universal ascending auction
- Substitutes and complements in network flows viewed as discrete convexity
- Coordinatewise domain scaling algorithm for M-convex function minimization
- Random allocations of multiple objects with incomplete information
- On the construction of substitutes
- The finite matroid-based valuation conjecture is false
- Competitive equilibrium with indivisible goods and symmetry
- Verifying gross substitutability.
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function
- A simplified analysis of the ascending auction to sell a matroid base
- Dual greedy polyhedra, choice functions, and abstract convex geometries
- Equivalence between substitutability and \(\mathrm{M}^\natural\)-concavity for set functions under discrete transfers
- Geometry of gross substitutes valuations
- Combinatorial auctions with decreasing marginal utilities
- Valuated matroid-based algorithm for submodular welfare problem
- Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions
- 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
- Competitive equilibrium and trading networks: a network flow approach
- Matroid rank functions and discrete concavity
- Indivisible goods, equilibrium and convex economies
- Optimal allocation in combinatorial auctions with quadratic utility functions
- Gross substitutes and endowed assignment valuations
- Core and competitive equilibria: an approach from discrete convex analysis
- Multiple Exchange Property for M♮-Concave Functions and Valuated Matroids
- Demand-flow of agents with gross-substitute valuations
- Designing matching mechanisms under constraints: an approach from discrete convex analysis
This page was built for publication: A Note on Kelso and Crawford's Gross Substitutes Condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704136)
