Gross substitutability: an algorithmic survey
From MaRDI portal
Publication:1682734
DOI10.1016/j.geb.2017.10.016zbMath1414.91268OpenAlexW2770911772MaRDI QIDQ1682734
Publication date: 5 December 2017
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2017.10.016
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) General equilibrium theory (91B50) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Related Items (22)
Independence systems in gross-substitute valuations ⋮ Ad Exchange: Envy-Free Auctions with Mediators ⋮ A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds ⋮ Fair allocation of indivisible goods: beyond additive valuations ⋮ Recent progress on integrally convex functions ⋮ Walrasian equilibria from an optimization perspective: A guide to the literature ⋮ On Groves mechanisms for costly inclusion ⋮ Combinatorial assortment optimization ⋮ On the correlation gap of matroids ⋮ On the Construction of Substitutes ⋮ Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices ⋮ Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes ⋮ When Are Welfare Guarantees Robust ⋮ Simpler exchange axioms for M-concave functions on generalized polymatroids ⋮ Buyback problem with discrete concave valuation functions ⋮ Walrasian's characterization and a universal ascending auction ⋮ Computing Walrasian equilibria: fast algorithms and structural properties ⋮ The Finite Matroid-Based Valuation Conjecture is False ⋮ Approximate Modularity Revisited ⋮ A Characterization of Combinatorial Demand ⋮ Competitive Equilibrium and Trading Networks: A Network Flow Approach ⋮ Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convexity and Steinitz's exchange property
- Greedoids
- Valuated matroids: A new look at the greedy algorithm
- Valuated matroids
- Walrasian equilibrium with gross substitutes
- The auction algorithm: A distributed relaxation method for the assignment problem
- Competitive equilibrium in an exchange economy with indivisibilities
- The asymptotic number of geometries
- The English auction with differentiated commodities
- \(M\)-convex functions and tree metrics
- Verifying gross substitutability.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Well-layered maps---a class of greedily optimizable set functions
- Rewarding maps: On greedy optimization of set functions
- PASS approximation: a framework for analyzing and designing heuristics
- The communication requirements of efficient allocations and supporting prices
- Combinatorial auctions with decreasing marginal utilities
- M-Convex Function on Generalized Polymatroid
- Stability and Polarization of Interests in Job Matching
- Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding
- Equilibria and Indivisibilities: Gross Substitutes and Complements
- Two Randomized Mechanisms for Combinatorial Auctions
- A Double-Track Adjustment Process for Discrete Markets With Substitutes and Complements
- Job Matching, Coalition Formation, and Gross Substitutes
- Discrete Convex Analysis
- Computing Walrasian Equilibria: Fast Algorithms and Structural Properties
- Gross substitutes and endowed assignment valuations
- Valuated Matroid Intersection I: Optimality Criteria
- Valuated Matroid Intersection II: Algorithms
- On Maximizing Welfare When Utility Functions Are Subadditive
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Matrices and matroids for systems analysis
This page was built for publication: Gross substitutability: an algorithmic survey
