Sharing the cost of multicast transmissions in wireless networks
From MaRDI portal
Publication:861267
DOI10.1016/j.tcs.2006.09.004zbMath1110.68005OpenAlexW1969986398MaRDI QIDQ861267
Alfredo Navarra, Luca Moscardelli, Michele Flammini, Vittorio Bilò, Giovanna Melideo
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.004
efficiencypower managementwireless networksalgorithmic mechanism designcost sharing mechanismsapproximate budget balanceness
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Communication theory (94A05)
Related Items (4)
When ignorance helps: graphical multicast cost sharing games ⋮ The price of stability for undirected broadcast network design with fair cost allocation is constant ⋮ The Price of Nash Equilibria in Multicast Transmissions Games ⋮ Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for Steiner trees
- Hardness results for multicast cost sharing.
- Power consumption in packet radio networks
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Minimum-energy broadcasting in static ad hoc wireless networks
- The minimum broadcast range assignment problem on linear multi-hop wireless networks.
- Approximation and collusion in multicast cost sharing
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Improved approximation results for the minimum energy broadcasting problem
- Algorithmic mechanism design (extended abstract)
- Contributions to the Theory of Games (AM-28), Volume II
- On the core and nucleolus of minimum cost spanning tree games
- Minimum cost spanning tree games
- Incentives in Teams
- On cost allocation for a spanning tree: A game theoretic approach
- Cost allocation for steiner trees
- Cooperative facility location games
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Applications of approximation algorithms to cooperative games
- Algorithms, games, and the internet
- Algorithms and Computation
- Euro-Par 2004 Parallel Processing
- Structural Information and Communication Complexity
- Optimum branchings
- Approximation and Online Algorithms
- Automata, Languages and Programming
- Algorithms - ESA 2003
- Sharing the cost of multicast transmissions
- Strategyproof sharing of submodular costs: budget balance versus efficiency
This page was built for publication: Sharing the cost of multicast transmissions in wireless networks