Bidding mechanisms for data allocation in multi-agent environments

Rina Schwartz; Sarit Kraus

Bidding mechanisms for data allocation in multi-agent environments

Rina Schwartz
, Sarit Kraus

Department of Mathematics

University of Maryland, College Park

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

11 Scopus citations

Abstract

We propose a bidding mechanism for data allocation in environments of self-motivated data servers with no common preferences and no central controller. The model considers situations where each server is concerned with the data stored locally, but does not have preferences concerning the exact storage location of data stored in remote servers. We considered situations of complete, as well as incomplete, information, and formally proved that our method is stable and yields honest bids. In the case of complete information, we also proved that the results obtained by the bidding approach are always better than the results obtained by the static allocation policy currently used for data allocation for servers in distributed systems. In the case of incomplete information, we demonstrated, using simulations, that the quality of the bidding mechanism is, on average, better than that of the static policy.

Original language	English
Title of host publication	Intelligent Agents IV
Subtitle of host publication	Agent Theories, Architectures, and Languages - 4th International Workshop, ATAL 1997, Proceedings
Editors	Munindar P. Singh, Anand Rao, Michael J. Wooldridge
Publisher	Springer Verlag
Pages	61-75
Number of pages	15
ISBN (Print)	3540641629, 9783540641629
State	Published - 1998
Event	4th International Workshop on Agent Theories, Architectures, and Languages, ATAL 1997 - Providence, United States Duration: 24 Jul 1997 → 26 Jul 1997

Publication series

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

Conference

Conference	4th International Workshop on Agent Theories, Architectures, and Languages, ATAL 1997
Country/Territory	United States
City	Providence
Period	24/07/97 → 26/07/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.

Cite this

Schwartz, R., & Kraus, S. (1998). Bidding mechanisms for data allocation in multi-agent environments. In M. P. Singh, A. Rao, & M. J. Wooldridge (Eds.), Intelligent Agents IV: Agent Theories, Architectures, and Languages - 4th International Workshop, ATAL 1997, Proceedings (pp. 61-75). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1365). Springer Verlag.

Schwartz, Rina ; Kraus, Sarit. / Bidding mechanisms for data allocation in multi-agent environments. Intelligent Agents IV: Agent Theories, Architectures, and Languages - 4th International Workshop, ATAL 1997, Proceedings. editor / Munindar P. Singh ; Anand Rao ; Michael J. Wooldridge. Springer Verlag, 1998. pp. 61-75 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{28f70715ed17443eb6f2a6b0cf34599b,

title = "Bidding mechanisms for data allocation in multi-agent environments",

abstract = "We propose a bidding mechanism for data allocation in environments of self-motivated data servers with no common preferences and no central controller. The model considers situations where each server is concerned with the data stored locally, but does not have preferences concerning the exact storage location of data stored in remote servers. We considered situations of complete, as well as incomplete, information, and formally proved that our method is stable and yields honest bids. In the case of complete information, we also proved that the results obtained by the bidding approach are always better than the results obtained by the static allocation policy currently used for data allocation for servers in distributed systems. In the case of incomplete information, we demonstrated, using simulations, that the quality of the bidding mechanism is, on average, better than that of the static policy.",

author = "Rina Schwartz and Sarit Kraus",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 4th International Workshop on Agent Theories, Architectures, and Languages, ATAL 1997 ; Conference date: 24-07-1997 Through 26-07-1997",

year = "1998",

language = "אנגלית",

isbn = "3540641629",

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

publisher = "Springer Verlag",

pages = "61--75",

editor = "Singh, \{Munindar P.\} and Anand Rao and Wooldridge, \{Michael J.\}",

booktitle = "Intelligent Agents IV",

address = "גרמניה",

}

Schwartz, R & Kraus, S 1998, Bidding mechanisms for data allocation in multi-agent environments. in MP Singh, A Rao & MJ Wooldridge (eds), Intelligent Agents IV: Agent Theories, Architectures, and Languages - 4th International Workshop, ATAL 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1365, Springer Verlag, pp. 61-75, 4th International Workshop on Agent Theories, Architectures, and Languages, ATAL 1997, Providence, United States, 24/07/97.

Bidding mechanisms for data allocation in multi-agent environments. / Schwartz, Rina; Kraus, Sarit.
Intelligent Agents IV: Agent Theories, Architectures, and Languages - 4th International Workshop, ATAL 1997, Proceedings. ed. / Munindar P. Singh; Anand Rao; Michael J. Wooldridge. Springer Verlag, 1998. p. 61-75 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1365).

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

TY - GEN

T1 - Bidding mechanisms for data allocation in multi-agent environments

AU - Schwartz, Rina

AU - Kraus, Sarit

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1998.

PY - 1998

Y1 - 1998

N2 - We propose a bidding mechanism for data allocation in environments of self-motivated data servers with no common preferences and no central controller. The model considers situations where each server is concerned with the data stored locally, but does not have preferences concerning the exact storage location of data stored in remote servers. We considered situations of complete, as well as incomplete, information, and formally proved that our method is stable and yields honest bids. In the case of complete information, we also proved that the results obtained by the bidding approach are always better than the results obtained by the static allocation policy currently used for data allocation for servers in distributed systems. In the case of incomplete information, we demonstrated, using simulations, that the quality of the bidding mechanism is, on average, better than that of the static policy.

AB - We propose a bidding mechanism for data allocation in environments of self-motivated data servers with no common preferences and no central controller. The model considers situations where each server is concerned with the data stored locally, but does not have preferences concerning the exact storage location of data stored in remote servers. We considered situations of complete, as well as incomplete, information, and formally proved that our method is stable and yields honest bids. In the case of complete information, we also proved that the results obtained by the bidding approach are always better than the results obtained by the static allocation policy currently used for data allocation for servers in distributed systems. In the case of incomplete information, we demonstrated, using simulations, that the quality of the bidding mechanism is, on average, better than that of the static policy.

UR - https://www.scopus.com/pages/publications/84961345371

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

AN - SCOPUS:84961345371

SN - 3540641629

SN - 9783540641629

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

SP - 61

EP - 75

BT - Intelligent Agents IV

A2 - Singh, Munindar P.

A2 - Rao, Anand

A2 - Wooldridge, Michael J.

PB - Springer Verlag

T2 - 4th International Workshop on Agent Theories, Architectures, and Languages, ATAL 1997

Y2 - 24 July 1997 through 26 July 1997

ER -

Schwartz R, Kraus S. Bidding mechanisms for data allocation in multi-agent environments. In Singh MP, Rao A, Wooldridge MJ, editors, Intelligent Agents IV: Agent Theories, Architectures, and Languages - 4th International Workshop, ATAL 1997, Proceedings. Springer Verlag. 1998. p. 61-75. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Bidding mechanisms for data allocation in multi-agent environments

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this