Computing Walrasian equilibria: fast algorithms and structural properties
From MaRDI portal
Publication:2288196
Recommendations
- Computing Walrasian equilibria: fast algorithms and structural properties
- A simple and efficient algorithm for computing market equilibria
- Market equilibrium via the excess demand function
- On the polynomial time computation of equilibria for certain exchange economies
- Gross substitutability: an algorithmic survey
Cites work
- \(M\)-convex function on generalized polymatroid
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Application of M-convex submodular flow problem to mathematical economics
- Competitive equilibrium in an exchange economy with indivisibilities
- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items
- Convexity and Steinitz's exchange property
- Designing matching mechanisms under constraints: an approach from discrete convex analysis
- Discrete Convex Analysis
- Discrete convexity and equilibria in economies with indivisible goods and money
- Do prices coordinate markets?
- Equilibria and Indivisibilities: Gross Substitutes and Complements
- Feature Article—The Ellipsoid Method: A Survey
- Full substitutability
- Gross substitutability: an algorithmic survey
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- Job Matching, Coalition Formation, and Gross Substitutes
- Matching is as easy as matrix inversion
- Matrices and matroids for systems analysis
- On ascending Vickrey auctions for heterogeneous objects
- On the computational power of demand queries
- Polynomial algorithms in linear programming
- Randomness efficient identity testing of multivariate polynomials
- Rewarding maps: On greedy optimization of set functions
- Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions
- Stability and Polarization of Interests in Job Matching
- Tatonnement beyond gross substitutes? Gradient descent to the rescue
- The communication requirements of efficient allocations and supporting prices
- The polynomial solvability of convex quadratic programming
- Valuated Matroid Intersection I: Optimality Criteria
- Valuated Matroid Intersection II: Algorithms
- Valuated matroids
- Valuated matroids: A new look at the greedy algorithm
- Walrasian equilibrium with gross substitutes
- Well-layered maps---a class of greedily optimizable set functions
Cited in
(17)- The Walras algorithm: A convergent distributed implementation of general equilibrium outcomes
- Gross substitutability: an algorithmic survey
- Optimal item pricing in online combinatorial auctions
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
- Computing the Evolution of Walrasian Behaviour
- Computing Walrasian equilibria: fast algorithms and structural properties
- Computing large market equilibria using abstractions
- Max-min greedy matching
- Do prices coordinate markets?
- Combinatorial Walrasian equilibrium
- Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices
- Optimal item pricing in online combinatorial auctions
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds
- Prophet upper bounds for online matching and auctions
- Online combinatorial assignment in independence systems
- Online combinatorial assignment in independence systems
- Walrasian equilibrium: Hardness, approximations and tractable instances
This page was built for publication: Computing Walrasian equilibria: fast algorithms and structural properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288196)
