Gross substitutability: an algorithmic survey
From MaRDI portal
Recommendations
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- Computing Walrasian equilibria: fast algorithms and structural properties
- Computing Walrasian equilibria: fast algorithms and structural properties
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Gross substitutes and endowed assignment valuations
Cites work
- \(M\)-convex function on generalized polymatroid
- \(M\)-convex functions and tree metrics
- A Double-Track Adjustment Process for Discrete Markets With Substitutes and Complements
- A Note on Kelso and Crawford's Gross Substitutes Condition
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Combinatorial auctions with decreasing marginal utilities
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Competitive equilibrium in an exchange economy with indivisibilities
- Computing Walrasian equilibria: fast algorithms and structural properties
- Convexity and Steinitz's exchange property
- Discrete Convex Analysis
- Equilibria and Indivisibilities: Gross Substitutes and Complements
- Greedoids
- Gross substitutes and endowed assignment valuations
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 7051222 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Job Matching, Coalition Formation, and Gross Substitutes
- Matrices and matroids for systems analysis
- On maximizing welfare when utility functions are subadditive
- Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding
- PASS approximation: a framework for analyzing and designing heuristics
- Rewarding maps: On greedy optimization of set functions
- Sketching valuation functions
- Stability and Polarization of Interests in Job Matching
- The asymptotic number of geometries
- The auction algorithm: A distributed relaxation method for the assignment problem
- The communication requirements of efficient allocations and supporting prices
- The English auction with differentiated commodities
- Two Randomized Mechanisms for Combinatorial Auctions
- Valuated Matroid Intersection I: Optimality Criteria
- Valuated Matroid Intersection II: Algorithms
- Valuated matroids
- Valuated matroids: A new look at the greedy algorithm
- Verifying gross substitutability.
- Walrasian equilibrium with gross substitutes
- Well-layered maps---a class of greedily optimizable set functions
Cited in
(49)- Substitute goods, auctions, and equilibrium
- Walrasian equilibrium with gross substitutes
- Gross substitution, discrete convexity, and submodularity
- Independence systems in gross-substitute valuations
- Simpler exchange axioms for M-concave functions on generalized polymatroids
- Buyback problem with discrete concave valuation functions
- Verifying gross substitutability.
- Walrasian's characterization and a universal ascending auction
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
- Combinatorial assortment optimization
- Geometry of gross substitutes valuations
- Computing Walrasian equilibria: fast algorithms and structural properties
- Fair allocation of indivisible goods: beyond additive valuations
- Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes
- Giffen Behaviour and Strong Asymmetric Gross Substitutability
- Ad exchange: envy-free auctions with mediators
- Computing Walrasian equilibria: fast algorithms and structural properties
- Gross substitutes and endowed assignment valuations
- The finite matroid-based valuation conjecture is false
- Competitive equilibrium and trading networks: a network flow approach
- When are welfare guarantees robust?
- Core pricing in combinatorial exchanges with financially constrained buyers: computational hardness and algorithmic solutions
- On the construction of substitutes
- Approximate modularity revisited
- A Characterization of Combinatorial Demand
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Recent progress on integrally convex functions
- Walrasian equilibria from an optimization perspective: A guide to the literature
- On Groves mechanisms for costly inclusion
- On the correlation gap of matroids
- Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices
- The frontier of intractability for EFX with two agents
- Local incentive compatibility on gross substitutes and other non-convex type-spaces
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds
- A flow-based ascending auction to compute buyer-optimal Walrasian prices
- A simplified analysis of the ascending auction to sell a matroid base
- Efficient two-sided markets with limited information
- Incremental-decremental maximization
- Combinatorial contracts
- The frontier of intractability for EFX with two agents
- On the correlation gap of matroids
- Class fairness in online matching
- On complete classes of valuated matroids
- Algorithmic contract theory: a survey
- Auction algorithms for market equilibrium with weak Gross substitute demands and their applications
- Recoverable robust cardinality constrained maximization with commitment of a submodular function
- Steepest descent algorithm for M-convex function minimization using long step length
- Incremental-decremental maximization
This page was built for publication: Gross substitutability: an algorithmic survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1682734)
