Approximation and collusion in multicast cost sharing

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2001, Pages 253-255

  Feigenbaum, J ^a   Krishnamurthy, A ^a   Sami, R ^a   Shenker, S ^b  

^a YALE UNIVERSITY   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COSTS; MATHEMATICAL MODELS; MULTICASTING; SIGNAL RECEIVERS;

BIDIRECTIONAL MODEL; MULTICAST COST SHARING; MULTICAST FLOW; MULTICAST TRANSMISSION MODEL;

ELECTRONIC COMMERCE;

EID: 0038060867     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

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. J. Feigenbaum, C. Papadimitriou, and S. Shenker, "Sharing the Cost of Multicast Transmissions," to appear in Journal of Computer and System Sciences. Available at http://www.cs.yale.edu/homes/jf/FPS.pdf
3. H. Moulin and S. Shenker, "Strategyproof Sharing of Submodular Costs: Budget Balance Versus Efficiency," 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.