Scholars@Duke

PROBABILISTIC BIDDING GIVES OPTIMAL DISTRIBUTED RESOURCE-ALLOCATION

Publication ,  Journal Article
REIF, J; SPIRAKIS, P
Published in: LECTURE NOTES IN COMPUTER SCIENCE
1984

Duke Scholars

John H. Reif
Author John H. Reif Computer Science

Published In

LECTURE NOTES IN COMPUTER SCIENCE

ISSN

0302-9743

Publication Date

1984

Volume

172

Start / End Page

393 / 402

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences
 

Citation

APA
Chicago
ICMJE
MLA
NLM
REIF, J., & SPIRAKIS, P. (1984). PROBABILISTIC BIDDING GIVES OPTIMAL DISTRIBUTED RESOURCE-ALLOCATION. LECTURE NOTES IN COMPUTER SCIENCE, 172, 393–402.
REIF, J., and P. SPIRAKIS. “PROBABILISTIC BIDDING GIVES OPTIMAL DISTRIBUTED RESOURCE-ALLOCATION.” LECTURE NOTES IN COMPUTER SCIENCE 172 (1984): 393–402.
REIF J, SPIRAKIS P. PROBABILISTIC BIDDING GIVES OPTIMAL DISTRIBUTED RESOURCE-ALLOCATION. LECTURE NOTES IN COMPUTER SCIENCE. 1984;172:393–402.
REIF, J., and P. SPIRAKIS. “PROBABILISTIC BIDDING GIVES OPTIMAL DISTRIBUTED RESOURCE-ALLOCATION.” LECTURE NOTES IN COMPUTER SCIENCE, vol. 172, 1984, pp. 393–402.
REIF J, SPIRAKIS P. PROBABILISTIC BIDDING GIVES OPTIMAL DISTRIBUTED RESOURCE-ALLOCATION. LECTURE NOTES IN COMPUTER SCIENCE. 1984;172:393–402.

Published In

LECTURE NOTES IN COMPUTER SCIENCE

ISSN

0302-9743

Publication Date

1984

Volume

172

Start / End Page

393 / 402

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences