Abstract
This paper deals with the implementation of an English auction on a distributed system. We assume that all messages are restricted to bids and resignations (referred to as the limited communication assumption) and that all participants are trying to maximize there gains (referred to as the prudence assumption). We also assume that bidders are risk-neutral, and that the underlying communication network is complete, asynchronous and failure-free. Under these assumptions, we show that the time and communication requirements of any auction process are 42(M2) and 42(M2 + n) respectively, where M2 denotes the second largest valuation of a participant in the auction.
We then develop a number of distributed algorithmic implementations for English auction, analyze their time and communication requirements, and propose an algorithm achieving optimal time and communication, i.e., meeting the above lower bounds. Finally we discuss extensions to the case of dynamically joining participants.
Supported in part by a grant from the Israel Ministry of Science and Art.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yedidia Atzmony. Distributed Algorithms for English Auctions. M.Sc. Thesis, The Weizmann Institute of Science, Mar. 2000.
C. Beam and A. Segev. Auctions on the Internet: A Field Study. Univ. of California, Berkeley; Can be found at http://haas.berkeley.edu/citm/research/underpublications
C. Beam, A. Segev and G.J. Shanthikumar. Electronic Negotiation through Internet-Based Auctions. CMIT Working Paper 96-WP-1019, Dec-96; Can be found at http://haas.berkeley.edu/citm/research/underpublications
R. Cassady. Auctions and Auctioneering. Univ. of California Press, 1967.
R.P. McAfee and J. McMillan. Auctions and Bidding. J. Economic Literature (1987), 699–738.
M. Naor, B. Pinkas and R. Sumner. Privacy Preserving Auctions and Mechanism Design. Proc. 1st ACM conf. on Electronic Commerce, Denver, Colorado, Nov. 1999.
M. Shubik. Auctions, Bidding and Markets: An Historical Sketch, in R. Engelbrecht-Wiggans, M. Shubik and R.M. Stark (Eds), Auctions, Bidding, and Contracting: Uses and Theory, New York university press, New York, 1983, pp. 165–191.
E. Wolfstetter. Auctions: An introduction. J. Economic Surveys 10, (1996), 367–417.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atzmony, Y., Peleg, D. (2000). Distributed Algorithms for English Auctions. In: Herlihy, M. (eds) Distributed Computing. DISC 2000. Lecture Notes in Computer Science, vol 1914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40026-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-40026-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41143-7
Online ISBN: 978-3-540-40026-4
eBook Packages: Springer Book Archive