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

DOI10.1007/11821069_32MaRDI QIDQ5756673zbMATH OpenOpenAlexFDO

Authors 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

limited number of best responsesMulticastNash equilibriaprice of anarchy

Mathematics Subject Classification ID

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

Recommendations

• On the convergence of multicast games in directed networks
• The Price of Nash Equilibria in Multicast Transmissions Games
• Designing fast converging cost sharing methods for multicast transmissions
• Algorithms and Computation
• Minimizing Rosenthal potential in multicast games

Cited in

(12)

• Designing fast converging cost sharing methods for multicast transmissions
• On the convergence of multicast games in directed networks
• Minimizing Rosenthal potential in multicast games
• Min-Cost Selfish Multicast With Network Coding
• Who should pay for forwarding packets?
• When Ignorance Helps: Graphical Multicast Cost Sharing Games
• Minimizing Rosenthal potential in multicast games
• Competitive routing in multicast communications
• The Price of Nash Equilibria in Multicast Transmissions Games
• Competitive cost sharing with economies of scale
• Algorithms and Computation
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756673)