Computing Walrasian Equilibria: Fast Algorithms and Structural Properties

@inproceedings{Leme2017ComputingWE,
  title={Computing Walrasian Equilibria: Fast Algorithms and Structural Properties},
  author={Renato Paes Leme and S. Wong},
  booktitle={SODA},
  year={2017}
}
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 $\widetilde{O}(n)$ times and takes $\widetilde{O}(n^3… Expand
8 Citations
Gross substitutability: An algorithmic survey
  • 64
  • PDF
Solving Strong-Substitutes Product-Mix Auctions
  • 3
  • PDF
The Invisible Hand of Dynamic Market Pricing
  • 31
  • PDF
Discrete convex analysis: A tool for economics and game theory
  • 58
  • PDF
Max-min greedy matching
  • 4
  • PDF
The Price is (Probably) Right: Learning Market Equilibria from Samples
  • PDF

References

SHOWING 1-10 OF 62 REFERENCES
Gross substitutability: An algorithmic survey
  • 64
  • PDF
On the Computational Power of Demand Queries
  • 59
  • PDF
Pricing Equilibria and Graphical Valuations
  • 11
  • PDF
The Invisible Hand of Dynamic Market Pricing
  • 31
  • Highly Influential
  • PDF
Valuated Matroid Intersection II: Algorithms
  • K. Murota
  • Computer Science, Mathematics
  • SIAM J. Discret. Math.
  • 1996
  • 68
  • Highly Influential
  • PDF
On ascending Vickrey auctions for heterogeneous objects
  • 181
  • PDF
...
1
2
3
4
5
...