When ignorance helps: graphical multicast cost sharing games
type: Item
instance of: scholarly article
title: When ignorance helps: graphical multicast cost sharing games
zbMATH Open document ID: 1185.91051
author: Vittorio Bilò
author: Angelo Fanelli
author: Michele Flammini
author: Luca Moscardelli
published in: Theoretical Computer Science
publication date: 2010-02-05T00:00:00Z
Mathematics Subject Classification ID: 91A40
Mathematics Subject Classification ID: 91A20
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91B44
zbMATH DE Number: 5666095
zbMATH Keywords: game theory
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: sharing games
zbMATH Keywords: graphical multi cast
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.10.007
OpenAlex ID: W1982650893
cites work: On the Value of Coordination in Network Design
cites work: Near-optimal network design with selfish agents
cites work: Approximation and collusion in multicast cost sharing
cites work: The Price of Nash Equilibria in Multicast Transmissions Games
cites work: Sharing the cost of multicast transmissions in wireless networks
cites work: Q3579454
cites work: Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
cites work: Hardness results for multicast cost sharing.
cites work: Sharing the cost of multicast transmissions
cites work: On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
cites work: Q2934710
cites work: Dynamic Steiner Tree Problem
cites work: Applications of approximation algorithms to cooperative games
cites work: Selfish Routing with Oblivious Users
cites work: A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
cites work: Q3409969
cites work: Q4749624
cites work: Network formation games with local coalitions
cites work: Congestion games with player-specific payoff functions
cites work: Structural Information and Communication Complexity
cites work: Approximation and Online Algorithms
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Algorithmic Game Theory
cites work: Q5817870
DOI: 10.1016/J.TCS.2009.10.007
description: scientific article; zbMATH DE number 5666095