Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms.
Prem KrishnaaGirija LimayeMeghana NasrePrajakta NimbhorkarPublished in: SAGT (2020)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- optimal solution
- special case
- vertex cover
- envy freeness
- minimum cost
- set cover
- computational complexity
- approximation ratio
- primal dual
- linear programming
- phase transition
- constant factor approximation
- undirected graph
- randomized algorithms
- combinatorial auctions
- branch and bound algorithm
- greedy algorithm
- constant factor
- upper bound
- open shop
- lower bound
- genetic algorithm
- sufficient conditions
- decision making