Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods.
Haris AzizGerhard RaucheckerGuido SchryenToby WalshPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- max min
- combinatorial auctions
- optimal allocation
- social welfare
- np hard
- min max
- resource allocation
- envy free
- special case
- worst case
- auction mechanisms
- vertex cover
- hill climbing
- network design problem
- minimum cost
- approximation ratio
- constant factor
- winner determination
- mechanism design
- set cover
- randomized algorithms
- open shop
- decision making
- primal dual
- utility function
- disjoint paths
- robust optimization
- polynomial time approximation
- simulated annealing
- optimal solution