Sharing the cost of multicast transmissions in wireless networks
type: Item
instance of: scholarly article
title: Sharing the cost of multicast transmissions in wireless networks
zbMATH Open document ID: 1110.68005
author: Vittorio Bilò
author: Michele Flammini
author: Luca Moscardelli
author: Alfredo Navarra
author: Giovanna Melideo
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 94A05
zbMATH DE Number: 5083790
zbMATH Keywords: wireless networks
zbMATH Keywords: power management
zbMATH Keywords: algorithmic mechanism design
zbMATH Keywords: cost sharing mechanisms
zbMATH Keywords: approximate budget balanceness
zbMATH Keywords: efficiency
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.09.004
OpenAlex ID: W1969986398
cites work: Automata, Languages and Programming
cites work: Approximation and collusion in multicast cost sharing
cites work: Euro-Par 2004 Parallel Processing
cites work: On cost allocation for a spanning tree: A game theoretic approach
cites work: Algorithms - ESA 2003
cites work: Q4427855
cites work: Algorithms and Computation
cites work: Q2762500
cites work: The minimum broadcast range assignment problem on linear multi-hop wireless networks.
cites work: Optimum branchings
cites work: Hardness results for multicast cost sharing.
cites work: Sharing the cost of multicast transmissions
cites work: Q4668738
cites work: Improved approximation results for the minimum energy broadcasting problem
cites work: Cooperative facility location games
cites work: Minimum cost spanning tree games
cites work: On the core and nucleolus of minimum cost spanning tree games
cites work: Incentives in Teams
cites work: Improved methods for approximating node weighted Steiner trees and connected dominating sets.
cites work: Applications of approximation algorithms to cooperative games
cites work: Q5688121
cites work: Power consumption in packet radio networks
cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
cites work: A fast algorithm for Steiner trees
cites work: Cost allocation for steiner trees
cites work: Incremental cost sharing: Characterization by coalition strategy-proofness
cites work: Strategyproof sharing of submodular costs: budget balance versus efficiency
cites work: Algorithmic mechanism design (extended abstract)
cites work: Q3624066
cites work: Algorithms, games, and the internet
cites work: Structural Information and Communication Complexity
cites work: Approximation and Online Algorithms
cites work: Q3867502
cites work: Contributions to the Theory of Games (AM-28), Volume II
cites work: Minimum-energy broadcasting in static ad hoc wireless networks
DOI: 10.1016/J.TCS.2006.09.004
description: scientific article; zbMATH DE number 5083790