A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Computing Walrasian equilibria: fast algorithms and structural properties

2018
*
Mathematical programming
*

We present the first polynomial time algorithm for computing Walrasian equilibrium in an economy with indivisible goods and general buyer valuations having only access to an 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 O(n) times and takes O(n 3 ) time, where n is the number of goods and

doi:10.1007/s10107-018-1334-9
fatcat:fytimwept5dejbxc4i5qvvpk4e