Distributed algorithms for english auctions

Yedidia Atzmony; David Peleg

doi:10.1007/3-540-40026-5_5

Distributed algorithms for english auctions

Yedidia Atzmony, David Peleg

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 Ω(M₂) and Ω(M₂ + n) respectively, where M₂ 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.

Original language	English
Title of host publication	Distributed Computing-14th InternationalConference, DISC 2000, Proceedings
Editors	Maurice Herlihy
Publisher	Springer Verlag
Pages	74-88
Number of pages	15
ISBN (Print)	3540411437
DOIs	https://doi.org/10.1007/3-540-40026-5_5
State	Published - 2000
Externally published	Yes
Event	14th International Conference on Distributed Computing, DISC 2000 - Toledo, Spain Duration: 4 Oct 2000 → 6 Oct 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1914
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	14th International Conference on Distributed Computing, DISC 2000
Country/Territory	Spain
City	Toledo
Period	4/10/00 → 6/10/00

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.

Access to Document

10.1007/3-540-40026-5_5

Cite this

Atzmony, Y., & Peleg, D. (2000). Distributed algorithms for english auctions. In M. Herlihy (Ed.), Distributed Computing-14th InternationalConference, DISC 2000, Proceedings (pp. 74-88). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1914). Springer Verlag. https://doi.org/10.1007/3-540-40026-5_5

@inproceedings{d7960d1833f84c17be2703cb5829098f,

title = "Distributed algorithms for english auctions",

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 Ω(M2) and Ω(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.",

author = "Yedidia Atzmony and David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 14th International Conference on Distributed Computing, DISC 2000 ; Conference date: 04-10-2000 Through 06-10-2000",

year = "2000",

doi = "10.1007/3-540-40026-5_5",

language = "אנגלית",

isbn = "3540411437",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "74--88",

editor = "Maurice Herlihy",

booktitle = "Distributed Computing-14th InternationalConference, DISC 2000, Proceedings",

address = "גרמניה",

}

Atzmony, Y & Peleg, D 2000, Distributed algorithms for english auctions. in M Herlihy (ed.), Distributed Computing-14th InternationalConference, DISC 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1914, Springer Verlag, pp. 74-88, 14th International Conference on Distributed Computing, DISC 2000, Toledo, Spain, 4/10/00. https://doi.org/10.1007/3-540-40026-5_5

Distributed algorithms for english auctions. / Atzmony, Yedidia; Peleg, David.
Distributed Computing-14th InternationalConference, DISC 2000, Proceedings. ed. / Maurice Herlihy. Springer Verlag, 2000. p. 74-88 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1914).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Distributed algorithms for english auctions

AU - Atzmony, Yedidia

AU - Peleg, David

PY - 2000

Y1 - 2000

N2 - 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 Ω(M2) and Ω(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.

AB - 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 Ω(M2) and Ω(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.

UR - http://www.scopus.com/inward/record.url?scp=84958818592&partnerID=8YFLogxK

U2 - 10.1007/3-540-40026-5_5

DO - 10.1007/3-540-40026-5_5

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84958818592

SN - 3540411437

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 74

EP - 88

BT - Distributed Computing-14th InternationalConference, DISC 2000, Proceedings

A2 - Herlihy, Maurice

PB - Springer Verlag

T2 - 14th International Conference on Distributed Computing, DISC 2000

Y2 - 4 October 2000 through 6 October 2000

ER -

Distributed algorithms for english auctions

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this