Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game

DOI10.1016/J.AUTOMATICA.2016.10.002zbMATH Open1353.91024OpenAlexW2560519335MaRDI QIDQ503156FDOQ503156

Authors: Seyed Rasoul Etesami, Tamer Başar 

Publication date: 11 January 2017

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2016.10.002

Recommendations

• Cache me if you can: capacitated selfish replication games
• Cache me if you can: capacitated selfish replication games in networks
• Selfish caching in distributed systems, a game-theoretic analysis
• Near-optimal network design with selfish agents
• The price of anarchy in network creation games

zbMATH Keywords

price of anarchyoptimal allocationpotential functioncapacitated selfish replication gamepure Nash equilibrium (NE)quasi-polynomial algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10) Games involving graphs (91A43)

Cites Work

• Algorithmic Game Theory
• Worst-case equilibria
• Selfish Routing in Capacitated Networks
• Potential games
• A Dual of Dilworth's Decomposition Theorem
• Congestion games with player-specific payoff functions
• On the impact of combinatorial structure on congestion games
• The complexity of pure Nash equilibria
• Tight Bounds for Selfish and Greedy Load Balancing
• A decomposition theorem for partially ordered sets
• Network formation and social coordination
• Selfish caching in distributed systems, a game-theoretic analysis
• Cache me if you can: capacitated selfish replication games
• A Game Theoretic Approach for Efficient Graph Coloring
• Efficiency loss in a network resource allocation game: the case of elastic supply

Cited In (5)

• Selfish caching in distributed systems, a game-theoretic analysis
• Cache me if you can: capacitated selfish replication games
• Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
• Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions
• Cache me if you can: capacitated selfish replication games in networks

This page was built for publication: Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game

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