An approximation algorithm and price of anarchy for the binary-preference capacitated selfish replication game

Keyphrases

• Approximation Algorithms 100%
• Capacitated 100%
• Game Model 33%
• Globally Optimal 33%
• Human Interaction 33%
• Linear Time 33%
• Nash Equilibrium 33%
• Number of Players 33%
• Optimal Allocation 66%
• Ordinal Potential 33%
• Price of Anarchy 100%
• Pure Nash Equilibrium 66%
• Quasi-polynomial Algorithm 33%
• Selfish Behavior 33%
• Service Provider 33%
• Social Entities 33%
• Social Networks 33%
• Social Studies 33%
• Tree Structure 33%
• Underlying Network 33%

Computer Science

• Approximation Algorithms 100%
• Constant Factor 50%
• Human Interaction 50%
• Nash Equilibrium 50%
• Optimal Allocation 100%
• Polynomial Algorithm 50%
• Potential Function 50%
• Service Provider 50%
• Social Network 50%
• Strategy Nash Equilibrium 100%
• Theoretic Model 50%
• Underlying Network 50%

Mathematics

• Constant Factor 33%
• Human Interaction 33%
• Linear Time 33%
• Nash Equilibrium 100%
• Polynomial 33%
• Potential Function 33%
• Simple Model 33%
• Tree Structure 33%