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

DOI10.1016/j.automatica.2016.10.002zbMath1353.91024OpenAlexW2560519335MaRDI QIDQ503156

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

zbMATH Keywords

potential functionoptimal allocationprice of anarchycapacitated selfish replication gamepure Nash equilibrium (NE)quasi-polynomial algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Cache me if you can: capacitated selfish replication games in networks ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks

Cites Work

• Unnamed Item
• Network formation and social coordination
• Potential games
• Congestion games with player-specific payoff functions
• A decomposition theorem for partially ordered sets
• Cache Me If You Can: Capacitated Selfish Replication Games
• On the impact of combinatorial structure on congestion games
• The complexity of pure Nash equilibria
• A Game Theoretic Approach for Efficient Graph Coloring
• Tight Bounds for Selfish and Greedy Load Balancing
• Efficiency loss in a network resource allocation game: the case of elastic supply
• Algorithmic Game Theory
• Selfish caching in distributed systems
• A Dual of Dilworth's Decomposition Theorem
• Selfish Routing in Capacitated Networks

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