Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pricing multicasting in more practical network models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Budget balanced mechanisms for the multicast pricing problem with rates
Proceedings of the 4th ACM conference on Electronic commerce
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Publish/subscribe systems have gained increasing interest in the past few years. There are many commercial products available today that rely on them directly. However, up to now there has been no discussion about pricing in such systemsWe present a new strategyproof distributed algorithm that calculates the maximum subtree of the broker network and the costs arising for the clients. These payments sum up to the amount defined by the marginal cost mechanism and maximize the social surplus (i.e. the sum of the utilities minus the costs). It is taken into account that there may be multiple publishers serving one filter. An extended self-stabilized version copes with systems whose structure underlies a permanent change when publishers (dis-) appear and client utility changes. An adjustment is presented that considers different rates for subscriptions and therefore weakens the previous all-or-nothing scenario.