Hardness results for multicast cost sharing.
type: Item
instance of: scholarly article
title: Hardness results for multicast cost sharing.
zbMATH Open document ID: 1045.68163
DOI: 10.1016/S0304-3975(03)00085-9
author: Joan Feigenbaum
author: Arvind Krishnamurthy
author: Rahul Sami
author: Scott Shenker
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 1965397
zbMATH Keywords: Algorithmic mechanism design
zbMATH Keywords: Communication complexity
zbMATH Keywords: Multicast
MaRDI profile type: Publication
cites work: Q4829038
cites work: Approximation and collusion in multicast cost sharing
cites work: A Concept of Egalitarianism Under Participation Constraints
cites work: Q4415250
cites work: Sharing the cost of multicast transmissions
cites work: Competitive generalized auctions
cites work: Q3208356
cites work: A crash course in implementation theory
cites work: Applications of approximation algorithms to cooperative games
cites work: Communication Complexity
cites work: Distributed games
cites work: Incremental cost sharing: Characterization by coalition strategy-proofness
cites work: Strategyproof sharing of submodular costs: budget balance versus efficiency
cites work: Q3624066
cites work: Algorithmic mechanism design
cites work: Q3867502
full work available at URL: s0304-3975(03)00085-9
OpenAlex ID: W1966991436
description: scientific article; zbMATH DE number 1965397