We investigate a general class of dynamical open-bid combinatorial auction protocols termed price-demand procedures, where the auctioneer asks buyer-dependent price vectors and buyers reveal demand sets. Such revelations are easier to practice than the revelations of entire valuations at once....

We investigate price-based mechanisms with connectedness in combinatorial auctions, where with restrictions of privacy and complexity, the auctioneer asks a limited number of prices to buyers who provide demand responses. Consistent with the price-based property, several necessary and sufficient...