On the convergence of multicast games in directed networks

DOI10.1007/S00453-008-9212-0MaRDI QIDQ2379922zbMATH OpenOpenAlexFDO

Authors Angelo Fanelli, Luca Moscardelli, Michele Flammini

Publication date 23 March 2010

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-008-9212-0

zbMATH Keywords

price of anarchylimited number of best-response movesmulticast gamesnon-cooperative networksshapley cost allocation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On the price of stability of undirected multicast games
• Distributed convergence to Nash equilibria in two-network zero-sum games
• Distributed convergence to Nash equilibria in network and average aggregative games
• Distributed Nash equilibrium seeking in an aggregative game on a directed graph
• Experimental and Efficient Algorithms
• Convergence Dynamics of Graphical Congestion Games
• Matrix games in the multicast networks: maximum information flows with network switching.
• The Price of Nash Equilibria in Multicast Transmissions Games
• scientific article; zbMATH DE number 2081020

Cites work

• scientific article; zbMATH DE number 2086616 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• A Concept of Egalitarianism Under Participation Constraints
• A class of games possessing pure-strategy Nash equilibria
• Applications of approximation algorithms to cooperative games
• Approximation and Online Algorithms
• Approximation and collusion in multicast cost sharing
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• CONGESTION GAMES AND POTENTIALS RECONSIDERED
• Congestion games with player-specific payoff functions
• Convergence and Approximation in Potential Games
• Convergence time to Nash equilibrium in load balancing
• Convergence to approximate Nash equilibria in congestion games
• Dynamic Steiner Tree Problem
• Equilibrium points in n -person games
• Hardness results for multicast cost sharing.
• How bad is selfish routing?
• Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
• New complexity results about Nash equilibria
• On a network creation game
• Potential games
• STACS 2005
• Sharing the cost of muliticast transmissions (preliminary version)
• Strong equilibrium in congestion games
• Structural Information and Communication Complexity
• Structural Information and Communication Complexity
• The Price of Stability for Network Design with Fair Cost Allocation
• The complexity of pure Nash equilibria
• The price of selfish routing
• Worst-case equilibria

Cited in

(3)

• Designing fast converging cost sharing methods for multicast transmissions
• Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
• The Price of Anarchy in Selfish Multicast Routing

This page was built for publication: On the convergence of multicast games in directed networks

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