On the value of information in distributed decision-making (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the value of information in distributed decision-making (extended abstract)

Full text

Pdf (368 KB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the tenth annual ACM symposium on Principles of distributed computing table of contents

Montreal, Quebec, Canada

Pages: 61 - 64

Year of Publication: 1991

ISBN:0-89791-439-2

Authors

Christos H. Papadimitriou	University of California at San Diego.
Mihalis Yannakakis	AT&T Bell Laboratories.

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 32, Citation Count: 10

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/112600.112606 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Ar	K. Arrow The Economics of Information, Harvard University Press, 1984.
	KP	P. C. Kanellakis, C. H. Papadimitriou "The Complexity of Distributed Concurrency Control," Proc. 1981 FOCS.
	PS	C. H. Papadimitriou, M. Sipser "Communication Complexity," Proc. 1981 FOC$.
	Yao	Andrew Chi-Chih Yao, Some complexity questions related to distributive computing(Preliminary Report), Proceedings of the eleventh annual ACM symposium on Theory of computing, p.209-213, April 30-May 02, 1979, Atlanta, Georgia, United States [doi>10.1145/800135.804414]

CITED BY 10

	Christos H. Papadimitriou , Mihalis Yannakakis, Linear programming without the matrix, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.121-129, May 16-18, 1993, San Diego, California, United States
	Noam Nisan , Amir Ronen, Algorithmic mechanism design (extended abstract), Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.129-140, May 01-04, 1999, Atlanta, Georgia, United States
	Grzegorz Greg Malewicz , Alexander Russell , Alex A. Shvartsman, Distributed cooperation in the absence of communication (brief announcement), Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, p.339, July 16-19, 2000, Portland, Oregon, United States
	Grzegorz Greg Malewicz , Alexander Russell , Alex Shvartsman, Optimal scheduling for disconnected cooperation, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, p.305-307, August 2001, Newport, Rhode Island, United States
	Marios Mavronicolas , Paul Spirakis, Optimal, distributed decision-making: the case of no communication, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, p.279, May 04-06, 1999, Atlanta, Georgia, United States
	Graham Brightwell , Teunis J. Ott , Peter Winkler, Target shooting with programmed random variables, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.691-698, May 04-06, 1992, Victoria, British Columbia, Canada
	Susanne Albers , Moses Charikar , Michael Mitzenmacher, Delayed information and action in on-line algorithms, Information and Computation, v.170 n.2, p.135-152, November 1, 2001
	Chryssis Georgiou , Alexander Russell , Alex A. Shvartsman, Work-competitive scheduling for cooperative computing with dynamic groups, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
	Chryssis Georgiou , Alexander Russell , Alex A. Shvartsman, distributed cooperation and adversity: complexity trade-offs, Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday, p.60-71, June 08-08, 2003, San Diego, California, USA
	Panagiota Fatourou , Marios Mavronicolas , Paul Spirakis, Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract), Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.139-148, August 21-24, 1997, Santa Barbara, California, United States