Abstract
In this note we give a survey of bisection auctions. Bisection auctions have been introduced in order to reduce the number of rounds and increase privacy of information in iterative implementations of Vickrey auctions. First, we present the case of discrete valuations. we discuss the strategic properties of this auction and recent results which show that--for 2 bidders--the auction dominates in a particular sense any other auction with respect to the number of bits revealed. For the case of continuous valuations we contrast its properties with the result that no practical query auction can achieve full efficiency in ex-post equilibrium.
Publisher
Association for Computing Machinery (ACM)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Asking questions;Games and Economic Behavior;2014-09
2. Approximate Privacy;ACM Transactions on Algorithms;2014-06