TY - GEN
T1 - On the computational power of iterative auctions
AU - Blumrosen, Liad
AU - Nisan, Noam
PY - 2005/6/5
Y1 - 2005/6/5
N2 - We embark on a systematic analysis of the power and limitations of iterative combinatorial auctions. Most existing iterative combinatorial auctions are based on repeatedly suggesting prices for bundles of items, and querying the bidders for their "demand" under these prices. We prove a large number of results showing the boundaries of what can be achieved by auctions of this kind. We first focus on auctions that use a polynomial number of demand queries, and then we analyze the power of different kinds of ascending-price auctions.
AB - We embark on a systematic analysis of the power and limitations of iterative combinatorial auctions. Most existing iterative combinatorial auctions are based on repeatedly suggesting prices for bundles of items, and querying the bidders for their "demand" under these prices. We prove a large number of results showing the boundaries of what can be achieved by auctions of this kind. We first focus on auctions that use a polynomial number of demand queries, and then we analyze the power of different kinds of ascending-price auctions.
KW - Ascending
KW - Auctions
KW - Combinatorial Auctions
KW - Communication Complexity
KW - Preference Elicitation
UR - https://www.scopus.com/pages/publications/30044444963
U2 - 10.1145/1064009.1064013
DO - 10.1145/1064009.1064013
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:30044444963
T3 - Proceedings of the ACM Conference on Electronic Commerce
SP - 29
EP - 43
BT - EC'05
PB - Association for Computing Machinery (ACM)
T2 - 6th ACM Conference on Electronic Commerce, EC 2005
Y2 - 5 June 2005 through 8 June 2005
ER -