ACM Home Page
Please provide us with feedback. Feedback
Approximation and collusion in multicast cost sharing (extended abstract)
Full text PdfPdf (121 KB)
Source Electronic Commerce archive
Proceedings of the 3rd ACM conference on Electronic Commerce table of contents
Tampa, Florida, USA
Pages: 253 - 255  
Year of Publication: 2001
ISBN:1-58113-387-1
Authors
J. Feigenbaum  Yale University, New Haven, CT
A. Krishnamurthy  Yale University, New Haven, CT
R. Sami  Yale University, New Haven, CT
S. Shenker  ACIRI/ICSI, Berkeley, CA
Sponsor
SIGEcom: ACM Special Interest Group on Electronic Commerce
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 8,   Citation Count: 4
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/501158.501190
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
J.Feigenbaum,A.Krishnamurthy,R.Sami,and S.Shenker,"Approximation and Collusion in Multicast Cost Sharing,"submitted.Available at http://www.cs.yale.edu/homes/jf/FKSS.pdf
 
2
 
3
H.Moulin and S.Shenker,"Strategyproo Sharing o Submodular Costs:Budget Balance Versus E .ciency," to appear in Economic Theory .Available at http://www.aciri.org/shenker/cost.pdf
 
4
N.Nisan and A.Ronen,"Algorithmic mechanism design,"Games and Economic Behavior 35 (2001), 166-196.


Collaborative Colleagues:
J. Feigenbaum: colleagues
A. Krishnamurthy: colleagues
R. Sami: colleagues
S. Shenker: colleagues

Peer to Peer - Readers of this Article have also read: