Iterative Combinatorial Auctions with Bidder-Determined Combinations
From MaRDI portal
Publication:3115458
DOI10.1287/mnsc.1040.0335zbMath1232.91318OpenAlexW1991469378MaRDI QIDQ3115458
G. Anandalingam, Roy H. Kwon, Lyle H. Ungar
Publication date: 21 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.1040.0335
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (7)
Combinatorial auctions ⋮ On the robustness of non-linear personalized price combinatorial auctions ⋮ Designing sniping agents ⋮ The stochastic bid generation problem in combinatorial transportation auctions ⋮ Exploring the VCG mechanism in combinatorial auctions: the threshold revenue and the threshold-price rule ⋮ Non-linear anonymous pricing combinatorial auctions ⋮ Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support
This page was built for publication: Iterative Combinatorial Auctions with Bidder-Determined Combinations