Sharing the Cost of Multicast Transmissions

Francis, 1993, Core based trees (CBT)

Clarke, 1971, Multipart pricing of public goods, Public Choice, 11, 17, 10.1007/BF01726210

Dasgupta, 1979, The implementation of social choice rules, Rev. Econ. Stud., 46, 185, 10.2307/2297045

Deering, 1990, Multicast routing in datagram internetworks and extended LANs, ACM Trans. Comput. Systems, 8, 85, 10.1145/78952.78953

Deering, 1996, The PIM architecture for wide-area multicast routing, ACM/IEEE Trans. Networking, 54, 153, 10.1109/90.490743

Ferguson, 1989, An economy for flow control in computer networks

E. Friedman, and, S. Shenker, Learning and Implementation in the Internet, preprint. [Available at, http://www.aciri.org/shenker/decent.ps, ]

Goldberg, 2001, Competitive auctions and digital goods

Green, 1976, Partial equilibrium approach to the free rider problem, J. Public Econ., 6, 375, 10.1016/0047-2727(76)90049-9

Green, 1979, Incentives in public decision making

Groves, 1973, Incentives in teams, Econometrica, 41, 617, 10.2307/1914085

Groves, 1987, Incentive compatibility since 1972

Holbrook, 1999, IP multicast channels: EXPRESS support for large-scale single-source applications

Hsiao, 1988, A game theoretic approach to decentralized flow control of markovian queueing networks

Johnson, 2000, The prize collecting steiner tree problem: Theory and practice

Korilis, 1995, Architecting noncooperative networks, J. Selected Areas Comm., 13, 1241, 10.1109/49.414643

Kurose, 1989, A microeconomic approach to optimal resource allocation in distributed computer systems, IEEE Trans. Comput., 38, 705, 10.1109/12.24272

Kushilevitz, 1997

Maskin, 1985, The theory of implementation in Nash equilibrium

Megiddo, 1978, Computational complexity of the game theory approach to cost allocation for a tree, Math. Oper. Res., 3, 189, 10.1287/moor.3.3.189

Moulin, 1999, Incremental cost sharing; characterization by strategyproofness, Social Choice and Welfare, 16, 279, 10.1007/s003550050145

H. Moulin, and, S. Shenker, Strategyproof sharing of submodular costs: Budget balance versus efficiency, Econom. Theory, to appear. [Available in preprint form at, http://www.aciri.org/shenker/cost.ps, ]

Nisan, 1999, Algorithms for selfish agents, 1563

Nisan, 2001, Algorithmic mechanism design, Games Econ. Behavior, 35, 166, 10.1006/game.1999.0790

Nisan, 2000, Computationally feasible VCG mechanisms

Osborne, 1994

R. Perlman, C.-Y. Lee, A. Ballardie, J. Crowcroft, Z. Wang, T. Maufer, C. Diot, and, M. Green, Simple multicast: A design for simple low-overhead multicast, IETF Internet Draft (work in progress).

Roberts, 1979, The characterization of implementable choice rules

Rosenschein, 1994

Sanders, 1988, An incentive compatible flow control algorithm for rate allocation in computer networks, IEEE Trans. Comput., 37, 1067, 10.1109/12.2257

Shapley, 1953, A value for n-person games

Shenker, 1990, Efficient network allocations with selfish users

Shenker, 1995, Making greed work in networks, ACM/IEEE Trans. Networking, 3, 819, 10.1109/90.477727

Shoham, 1997, Economic principles of multi-agent systems, Artificial Intell., 94, 1, 10.1016/S0004-3702(97)00029-5

Shubik, 1962, Incentives, decentralized controls, the assignment of joint costs and internal pricing, Management Sci., 8, 325, 10.1287/mnsc.8.3.325

Vickrey, 1961, Counterspeculation, auctions, and competitive sealed tenders, J. Finance, 16, 8, 10.1111/j.1540-6261.1961.tb02789.x

Walsh, 1998, A market protocol for decentralized task allocation