An approximation algorithm and price of anarchy for the binary-preference capacitated selfish replication game.
Seyed Rasoul EtesamiTamer BasarPublished in: CDC (2015)
Keyphrases
- np hard
- preprocessing
- dynamic programming
- optimal solution
- computational complexity
- expectation maximization
- learning algorithm
- objective function
- search space
- k means
- worst case
- monte carlo
- cost function
- particle swarm optimization
- genetic algorithm
- detection algorithm
- matching algorithm
- combinatorial optimization
- computer games
- approximation algorithms
- single source
- minimal cost
- polygonal approximation