Posted price profit maximization for multicast by approximating fixed points
暂无分享,去创建一个
[1] Amos Fiat,et al. Competitive generalized auctions , 2002, STOC '02.
[2] Stephen E. Deering,et al. Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.
[3] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[4] Joan Feigenbaum,et al. Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..
[5] H. Moulin,et al. Strategyproof sharing of submodular costs:budget balance versus efficiency , 2001 .
[6] Jeremy I. Bulow,et al. The Simple Economics of Optimal Auctions , 1989, Journal of Political Economy.
[7] Yuval Rabani,et al. Allocating bandwidth for bursty connections , 1997, STOC '97.
[8] Herbert E. Scarf,et al. The Approximation of Fixed Points of a Continuous Mapping , 1967 .
[9] Deborah Estrin,et al. An architecture for wide-area multicast routing , 1994, SIGCOMM 1994.
[10] Vijay V. Vazirani,et al. Applications of approximation algorithms to cooperative games , 2001, STOC '01.
[11] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[12] Lars Eldén,et al. Numerical analysis: an introduction , 1990 .
[13] Deborah Estrin,et al. The PIM architecture for wide-area multicast routing , 1996, TNET.
[14] Michel Bierlaire,et al. New Algorithmic Approaches for the Anticipatory Route Guidance Generation Problem , 2001 .
[15] Andrew V. Goldberg,et al. Competitive auctions and digital goods , 2001, SODA '01.
[16] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[17] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.
[18] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .