Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Positions.
Elliot AnshelevichWennan ZhuPublished in: ACM Trans. Economics and Comput. (2021)
Keyphrases
- facility location problem
- social choice
- approximation algorithms
- facility location
- np hard
- submodular functions
- special case
- np complete
- link prediction
- fuzzy logic
- computationally feasible
- social networks
- computational social choice
- sensitivity analysis
- branch and bound
- worst case
- multi criteria
- upper bound
- dynamic programming
- demand points