On the convergence of multicast games in directed networks

DOI10.1007/S00453-008-9212-0zbMATH Open1184.68122OpenAlexW1993460328MaRDI QIDQ2379922FDOQ2379922

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

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

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)

Cites Work

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

Cited In (3)

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

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)