DMCA
Approximate Budget Balanced Mechanisms with Low Communication Costs for the Multicast Cost-Sharing Problem
Cached
Download Links
- [www.inf.ethz.ch]
- [www-cc.cs.uni-saarland.de]
- [www-cc.cs.uni-sb.de]
- DBLP
Other Repositories/Bibliography
| Citations: | 1 - 0 self |
BibTeX
@MISC{Bläser_approximatebudget,
author = {Markus Bläser},
title = {Approximate Budget Balanced Mechanisms with Low Communication Costs for the Multicast Cost-Sharing Problem},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Introduction We investigate the relation between budget balance and communication for the multicast cost-sharing problem in the context of distributed algorithmic mechanism design. We use the formal model introduced by Feigenbaum, Papadimitriou, and Shenker [3]: Our network is a rooted undirected tree T = (V, E) with n nodes. The root r of T models the service provider. The set P of leaves of T represents the users, who wish to receive the transmission of the provider. Let p = |P |. Each e E has a weight c e . This weight represents the costs of using e for the transmission. If a transmission is sent to a subset R P of the users, then it is sent along the edges of the smallest subtree of T containing r and all nodes of R. We call this subtree T (R). The costs c(T (R)) of this subtree is the sum of the weight of its edges. Each i P has a utility u i which he derives from getting the transmission. The u i are private information. A cost-sharing mechanism determines which of
