Computing Walrasian Equilibria: Fast Algorithms and Structural Properties
Renato Paes Leme, Sam Chiu-wai Wong

TL;DR
This paper introduces the first polynomial-time algorithms for computing Walrasian equilibria with indivisible goods using aggregate demand oracles, and improves efficiency for gross substitute valuations.
Contribution
It presents novel polynomial-time algorithms for Walrasian equilibrium computation in general and gross substitute cases, utilizing aggregate demand and value oracles.
Findings
First polynomial-time algorithm with aggregate demand oracle
Fastest known algorithm in value oracle model for gross substitute valuations
Characterization of conditions for robust Walrasian prices
Abstract
We present the first polynomial time algorithm for computing Walrasian equilibrium in an economy with indivisible goods and \emph{general} buyer valuations having only access to an \emph{aggregate demand oracle}, i.e., an oracle that given prices on all goods, returns the aggregated demand over the entire population of buyers. For the important special case of gross substitute valuations, our algorithm queries the aggregate demand oracle times and takes time, where is the number of goods. At the heart of our solution is a method for exactly minimizing certain convex functions which cannot be evaluated but for which the subgradients can be computed. We also give the fastest known algorithm for computing Walrasian equilibrium for gross substitute valuations in the \emph{value oracle model}. Our algorithm has running time $\widetilde{O}((mn +…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEconomic theories and models · Auction Theory and Applications · Economic Theory and Institutions
