See this document in CiteSeerX!

Hardness Results for Multicast Cost Sharing (2003)  (Make Corrections)  (10 citations)
Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker



  Home/Search   Context   Related

 
View or download:
yale.edu/homes/jf/FKSS2.ps
yale.edu/~arvind/papers/fkss2.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  yale.edu/homes/jf/ (more)
(Enter author homepages)

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

Abstract: We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of group-strategyproof, budget-balanced mechanisms. We also extend a classical impossibility result in game theory to show that no strategyproof mechanism can be both approximately efficient and approximately budget-balanced. Our results show that one important and natural case of multicast cost sharing... (Update)

Cited by:   More
The Communication Cost of Selshness: - Ex Post Implementation   (Correct)
Approximate Budget Balanced Mechanisms with Low Communication.. - Bläser   (Correct)
Budget Balanced Mechanisms for the Multicast Pricing Problem with .. - Bläser (2003)   (Correct)

Similar documents (at the sentence level):   More
59.5%:   Distributed Algorithmic Mechanism Design - Sami (2003)   (Correct)
45.0%:   Hardness Results for Multicast Cost Sharing - Feigenbaum, Krishnamurthy.. (2002)   (Correct)
27.1%:   Hardness Results for Multicast Cost Sharing (Extended.. - Feigenbaum.. (2002)   (Correct)

Active bibliography (related documents):   More   All
0.8:   Distributed Algorithmic Mechanism Design: Recent Results.. - Feigenbaum, Shenker (2002)   (Correct)
0.8:   Sharing the Cost of Multicast Transmissions - Feigenbaum, Papadimitriou.. (2000)   (Correct)
0.3:   Incentive Compatible Multi Unit Combinatorial Auctions - Bartal, Gonen (2002)   (Correct)

Similar documents based on text:   More   All
0.5:   A BGP-based Mechanism for Lowest-Cost Routing - Feigenbaum, Papadimitriou, Sami (2002)   (Correct)

Related documents from co-citation:   More   All
9:   Sharing the cost of multicast transmissions - Feigenbaum, Papadimitriou et al. - 2000
8:   Strategyproof Sharing of Submodular Costs: Budget Balance Versus E#ciency - Moulin, Shenker - 1997
6:   Algorithmic mechanism design - Nisan, Ronen - 1999

BibTeX entry:   (Update)

J. Feigenbaum, A. Krishnamurthy, R. Sami, and S. Shenker, "Hardness Results for Multicast Cost Sharing," Yale University Technical Report YALEU/DCS/TR1232, June 2002, http://ftp.cs.yale.edu/pub/TR/tr1232.ps http://citeseer.ist.psu.edu/feigenbaum03hardness.html   More

@misc{ feigenbaum02hardness,
  author = "J. Feigenbaum and A. Krishnamurthy and R. Sami and S. Shenker",
  title = "Hardness Results for Multicast Cost Sharing",
  text = "J. Feigenbaum, A. Krishnamurthy, R. Sami, and S. Shenker, Hardness Results
    for Multicast Cost Sharing, Yale University Technical Report YALEU/DCS/TR1232,
    June 2002, http://ftp.cs.yale.edu/pub/TR/tr1232.ps",
  year = "2002",
  url = "citeseer.ist.psu.edu/feigenbaum03hardness.html" }
Citations (may not include all citations):
203   The PIM architecture for wide-area multicast routing - Deering, Estrin et al. - 1996
137   Algorithmic mechanism design - Nisan, Ronen - 2001
133   IP multicast channels: Express support for large-scale singl.. - Holbrook, Cheriton - 1999
98   Architecting noncooperative networks - Korilis, Lazar et al. - 1995
95   Sharing the cost of multicast transmissions - Feigenbaum, Papadimitriou et al. - 2001
90   A microeconomic approach to optimal resource allocation in d.. (context) - Kurose, Simha - 1989
87   Computationally feasible VCG mechanisms - Nisan, Ronen - 2000
68   Communication Complexity (context) - Kushilevitz, Nisan - 1997
61   Distributed Algorithmic Mechanism Design: Recent Results and.. - Feigenbaum, Shenker - 2002
39   Strategyproof Sharing of Submodular Costs: Budget Balance Ve.. - Moulin, Shenker - 2001
36   An economy for flow control in computer networks (context) - Ferguson, Nikolaou et al. - 1989
35   Competitive Generalized Auctions - Fiat, Goldberg et al. - 2002
31   Incentives in Public Decision Making (context) - Green - 1979
30   Core Based Trees (CBT (context) - Ballardie, Francis et al. - 1993
26   Learning and Implementation in the Internet - Friedman, Shenker - 1997
23   Sharing the `cost' of multicast trees: An axiomatic analysis - Herzog, Shenker et al. - 1997
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
19   Private communication (context) - Mitchell, Teague - 2002
18   The Characterization of Implementable Choice Rules (context) - Roberts - 1979
17   Distributed Games: From Mechanisms to Protocols - Monderer, Tennenholtz - 1999
17   A concept of egalitarianism under participation constraints (context) - Dutta, Ray - 1989
12   A Crash Course in Implementation Theory - Jackson - 2001
11   A game theoretic approach to decentralized flow control of M.. (context) - Hsiao, Lazar - 1988
10   Applications of approximation to cooperative games (context) - Jain, Vazirani - 2001
10   An incentive compatible flow control algorithm for rate allo.. (context) - Sanders - 1988
9   Approximation and Collusion in Multicast Cost Sharing - Archer, Feigenbaum et al. - 2002
5   Pricing Multicast in More Practical Network Models (context) - Adler, Rubenstein - 2002
4   The Communication Complexity of E#cient Allocation Problems (context) - Nisan, Segal - 2002
3   Making greed work in networks (context) - Shenker - 1995
1   E#cient network allocations with selfish users (context) - Shenker - 1990
1   Hardness Results for Multicast Cost Sharing (Extended Abstra.. - Feigenbaum, Krishnamurthy et al. - 2002



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


Documents on the same site (http://cs-www.cs.yale.edu/homes/jf/):   More
Economic Barriers to the Deployment of Existing.. - Feigenbaum.. (2002)   (Correct)
Distributed Algorithmic Mechanism Design: Recent Results.. - Feigenbaum, Shenker (2002)   (Correct)
Hardness Results for Multicast Cost Sharing - Feigenbaum, Krishnamurthy.. (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