Budget balanced mechanisms for the multicast pricing problem with rates

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Budget balanced mechanisms for the multicast pricing problem with rates

Full text

Pdf (125 KB)

Source

Electronic Commerce archive
Proceedings of the 4th ACM conference on Electronic commerce table of contents

San Diego, CA, USA

POSTER SESSION: Poster paper sessions table of contents

Pages: 194 - 195

Year of Publication: 2003

ISBN:1-58113-679-X

Authors

Markus Bläser	Universität zu Lübeck, Lübeck, Germany
Bodo Manthey	Universität zu Lübeck, Lübeck, Germany

Sponsors

ACM: Association for Computing Machinery
SIGEcom: ACM Special Interest Group on Electronic Commerce

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 14, Citation Count: 1

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/779928.779955 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.

	1	Micah Adler , Dan Rubenstein, Pricing multicasting in more practical network models, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.981-990, January 06-08, 2002, San Francisco, California
	2	Joan Feigenbaum , Christos Papadimitriou , Scott Shenker, Sharing the cost of muliticast transmissions (preliminary version), Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.218-227, May 21-23, 2000, Portland, Oregon, United States [doi>10.1145/335305.335332]
	3	Michel X. Goemans , David P. Williamson, A General Approximation Technique for Constrained Forest Problems, SIAM Journal on Computing, v.24 n.2, p.296-317, April 1995 [doi>10.1137/S0097539793242618]
	4	Kamal Jain , Vijay Vazirani, Applications of approximation algorithms to cooperative games, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.364-372, July 2001, Hersonissos, Greece [doi>10.1145/380752.380825]
	5	H. Moulin. Incremental cost sharing: Characterization by strategyproofness. Social Choice and Welfare, 16:279--320, 1999.