Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Allocating bandwidth for bursty connections
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Iterative solution of nonlinear equations in several variables
Iterative solution of nonlinear equations in several variables
Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Competitive generalized auctions
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
On algorithms for discrete and approximate brouwer fixed points
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Matching algorithmic bounds for finding a Brouwer fixed point
Journal of the ACM (JACM)
Discrete Fixed Points: Models, Complexities, and Applications
Mathematics of Operations Research
Bayesian optimal no-deficit mechanism design
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
| Hi-index | 0.00 |
We describe a fixed point approach for the following stochastic optimization problem: given a multicast tree and probability distributions of user utilities, compute prices to offer the users in order to maximize the expected profit of the service provider. We show that any optimum pricing is a fixed point of an efficiently computable map. In the language of classical numerical analysis, we show that the non-linear Jacobi and Gauss-Seidel methods of coordinate descent are applicable to this problem. We provide proof of convergence to the optimum prices for special cases of utility distributions and tree edge costs.