Sciweavers

Share
SIAMCOMP
2016

Combinatorial Walrasian Equilibrium

3 years 12 days ago
Combinatorial Walrasian Equilibrium
We study a combinatorial market design problem, where a collection of indivisible objects is to be priced and sold to potential buyers subject to equilibrium constraints. The classic solution concept for such problems is Walrasian Equilibrium (WE), which provides a simple and transparent pricing structure that achieves optimal social welfare. The main weakness of the WE notion is that it exists only in very restrictive cases. To overcome this limitation, we introduce the notion of a Combinatorial Walrasian equilibium (CWE), a natural relaxation of WE. The difference between a CWE and a (non-combinatorial) WE is that the seller can package the items into indivisible bundles prior to sale, and the market does not necessarily clear. We show that every valuation profile admits a CWE that obtains at least half of the optimal (unconstrained) social welfare. Moreover, we devise a poly-time algorithm that, given an arbitrary allocation X, computes a CWE that achieves at least half of the we...
Michal Feldman, Nick Gravin, Brendan Lucier
Added 09 Apr 2016
Updated 09 Apr 2016
Type Journal
Year 2016
Where SIAMCOMP
Authors Michal Feldman, Nick Gravin, Brendan Lucier
Comments (0)
books