See this document in CiteSeerX!

Sharing the Cost of Multicast Transmissions (2000)  (Make Corrections)  (95 citations)
Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker
Journal of Computer and System Sciences



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
brown.edu/courses/cs2959/pap...FPS.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  brown.edu/courses/cs2959/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper, we focus on the communication burden of algorithms for implementing the MC and SH cost-sharing mechanisms. We prove a lower bound suggesting that any cost-sharing algorithm implementing the Shapley-value mechanism must send a linear number of messages over each of a linear number of links, a quadratic number of messages overall (Update)

Cited by:   More
On the Expected Payment of Mechanisms for Task Allocation - Artur Czumaj Amir   (Correct)
Distributed Computing manuscript No. - Will Be Inserted   (Correct)
A Survey on Networking Games in Telecommunications - Altman, Boulogne.. (2003)   (Correct)

Similar documents (at the sentence level):
46.4%:   Sharing the Cost of Multicast Transmissions - Feigenbaum, Papadimitriou.. (2001)   (Correct)

Active bibliography (related documents):   More   All
0.8:   Hardness Results for Multicast Cost Sharing - Feigenbaum, Krishnamurthy.. (2003)   (Correct)
0.6:   Distributed Algorithmic Mechanism Design: Recent Results.. - Feigenbaum, Shenker (2002)   (Correct)
0.4:   Approximation and Collusion in Multicast Cost Sharing - Feigenbaum.. (2001)   (Correct)

Similar documents based on text:   More   All
0.3:   Towards a Theory of Data Entanglement - Aspnes, Feigenbaum, Yampolskiy.. (2004)   (Correct)
0.3:   Privacy Engineering for Digital Rights Management Systems - Feigenbaum, Freedman.. (2001)   (Correct)
0.2:   An Approximate L¹-Difference Algorithm for Massive.. - Feigenbaum, Kannan, al. (2001)   (Correct)

Related documents from co-citation:   More   All
55:   Algorithmic mechanism design - Nisan, Ronen - 1999
34:   Incentives in Teams (context) - Groves - 1973
31:   Multipart Pricing of Public Goods (context) - Clarke - 1971

BibTeX entry:   (Update)

Joan Feigenbaum, Christos Papadimitriou, and Scott Shenker. Sharing the cost of multicast transmissions. In Thirty-Second Annual ACM Symposium on Theory of Computing (STOC00), May 2000. http://citeseer.ist.psu.edu/feigenbaum00sharing.html   More

@article{ feigenbaum01sharing,
    author = "Joan Feigenbaum and Christos H. Papadimitriou and Scott Shenker",
    title = "Sharing the Cost of Multicast Transmissions",
    journal = "Journal of Computer and System Sciences",
    volume = "63",
    number = "1",
    pages = "21-41",
    year = "2001",
    url = "citeseer.ist.psu.edu/feigenbaum00sharing.html" }
Citations (may not include all citations):
450   Multicast routing in datagram internetworks and extended LAN.. (context) - Deering - 1990
282   A Course in Game Theory (context) - Osborne - 1994
243   Rules of Encounter: Designing Conventions for Automated Nego.. (context) - Rosenschein, Zlotkin - 1994
215   Multipart pricing of public goods (context) - Clarke - 1971
214   Incentives in teams (context) - Groves - 1973
203   The PIM architecture for wide-area multicast routing - Deering, Estrin et al. - 1996  ACM   DBLP
174   and competitive sealed tenders (context) - Vickrey - 1961
168   Core Based Trees (context) - Ballardie, Francis et al. - 1993
137   Algorithmic mechanism design - Nisan, Ronen - 2001
133   IP multicast channels: EXPRESS support for large-scale singl.. - Holbrook, Cheriton - 1999  DBLP
98   Architecting noncooperative networks - Korilis, Lazar et al. - 1995  ACM   DBLP
90   A microeconomic approach to optimal resource allocation in d.. (context) - Kurose, Simha - 1989
87   Computationally Feasible VCG Mechanisms - Nisan, Ronen - 2000  ACM   DBLP
68   Communication Complexity (context) - Kushilevitz, Nisan - 1997  ACM   DBLP
63   person games (context) - Shapley - 1953
60   Competitive Auctions and Digital Goods - Goldberg, Hartline et al. - 2001
46   A market protocol for decentralized task allocation - Walsh, Wellman - 1998  ACM
39   Strategyproof Sharing of Submodular Costs: Budget Balance Ve.. - Moulin, Shenker - 1997
36   An economy for flow control in computer networks (context) - Ferguson, Nikolaou et al. - 1989  DBLP
31   Incentives in public decision making (context) - Green, La - 1979
26   Learning and Implementation in the Internet - Friedman - 1997
23   The prize collecting steiner tree problem: theory and practi.. - Johnson, Minko et al. - 2000  DBLP
22   Simple multicast: A design for simple low-overhead multicast (context) - Perlman, Lee et al. - 1999
20   Incremental cost sharing; characterization by strategyproofn.. (context) - Moulin - 1999
18   The Characterization of Implementable Choice Rules (context) - Roberts - 1979
18   Algorithms for selfish agents (context) - Nisan - 1999  DBLP
13   Computational complexity of the game theory approach to cost.. (context) - Megiddo - 1978
11   A game theoretic approach to decentralized flow control of m.. (context) - Hsiao - 1988  ACM   DBLP
10   An incentive compatible flow control algorithm for rate allo.. (context) - Sanders - 1988  ACM   DBLP
10   Partial equilibrium approach to the free rider problem (context) - Green, Kohlberg et al. - 1976
7   The implementation of social choice rules (context) - Dasgupta, Hammond et al. - 1979
6   The theory of implementation in Nash equilibrium (context) - Maskin - 1985
6   the assignment of joint costs and internal pricing (context) - Shubik - 1962
5   Economic principles of multi-agent systems (context) - Shoham, Wellman - 1997  ACM   DBLP
3   Making greed work in networks (context) - Shenker - 1995
2   cient network allocations with selfish users (context) - Shenker - 1990



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.brown.edu/courses/cs295-9/):   More
How Bad is Selfish Routing? - Roughgarden, Tardos (2001)   (Correct)
Selfish Traffic Allocation for Server Farms - Czumaj, Krysta, Vöcking (2003)   (Correct)
Bounding the Inefficiency of Equilibria in Nonatomic.. - Roughgarden, Tardos (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC