Erlanson, Albin (2014) The Duo-Item Bisection Auction. Computational Economics, 43 (1). pp. 15-31. DOI https://doi.org/10.1007/s10614-013-9380-0
Erlanson, Albin (2014) The Duo-Item Bisection Auction. Computational Economics, 43 (1). pp. 15-31. DOI https://doi.org/10.1007/s10614-013-9380-0
Erlanson, Albin (2014) The Duo-Item Bisection Auction. Computational Economics, 43 (1). pp. 15-31. DOI https://doi.org/10.1007/s10614-013-9380-0
Abstract
This paper proposes an iterative sealed-bid auction for selling multiple heterogeneous items to bidders interested in buying at most one item. It generalizes the single item bisection auction (Grigorieva et al. Econ Theory, 30:107–118, 2007) to the environment with multiple heterogeneous items. We focus on the case with two items for sale. We show that the auction elicits a minimal amount of information on preferences required to find the Vickrey–Clark–Groves outcome (Clarke, Public Choice, XI:17–33, 1971; Groves, Econometrica, 61:617–631, 1973; Vickrey, J Finance, 16:8–37, 1961), when there are two items for sale and an arbitrary number of bidders.
Item Type: | Article |
---|---|
Divisions: | Faculty of Social Sciences Faculty of Social Sciences > Economics, Department of |
SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
Depositing User: | Unnamed user with email elements@essex.ac.uk |
Date Deposited: | 09 Oct 2020 15:01 |
Last Modified: | 06 Jan 2022 14:02 |
URI: | http://repository.essex.ac.uk/id/eprint/24992 |