I present two modifications of the Vickrey-Clark-Groves mechanism to accommodate bidders' budget constraints in the combinatorial auction setting and show that they are Pareto-Optimal and (partially) incentive compatible in certain domains.
Le REF presented two modifications of the Vickrey-Clark-Groves mechanism to accommodate bidders' budget constraints in the combinatorial auction setting.
Modified VCG Mechanisms in Combinatorial Auctions with Budget Constraints
SSRN Electronic Journal
SSRN Electronic Journal
Economics