Approximation Algorithm for the Binary-Preference Capacitated Selfish Replication Game and a Tight Bound on its Price of Anarchy.
Seyed Rasoul EtesamiTamer BasarPublished in: CoRR (2015)
Keyphrases
- worst case
- dynamic programming
- np hard
- k means
- probabilistic model
- error bounds
- detection algorithm
- segmentation algorithm
- cost function
- lower bound
- preprocessing
- computational complexity
- space complexity
- search space
- nash equilibrium
- linear programming
- learning algorithm
- closed form
- benchmark problems
- approximation algorithms
- polygonal approximation
- randomized algorithm
- convex hull
- expectation maximization
- upper bound
- optimal solution
- objective function
- clustering algorithm