Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves

DOI10.1007/11821069_32zbMath1132.68305OpenAlexW1504647200MaRDI QIDQ5756673

Angelo Fanelli, Michele Flammini, Luca Moscardelli, Giovanna Melideo

Publication date: 5 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11821069_32

zbMATH Keywords

Nash equilibriaprice of anarchyMulticastlimited number of best responses

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Other game-theoretic models (91A40)

Related Items (5)

When ignorance helps: graphical multicast cost sharing games ⋮ On the convergence of multicast games in directed networks ⋮ The Price of Nash Equilibria in Multicast Transmissions Games ⋮ Competitive cost sharing with economies of scale ⋮ When Ignorance Helps: Graphical Multicast Cost Sharing Games

This page was built for publication: Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves