A Matroid Approach to the Worst Case Allocation of Indivisible Goods.
Laurent GourvèsJérôme MonnotLydia TlilanePublished in: IJCAI (2013)
Keyphrases
- nsga ii
- envy free
- pareto optimal
- worst case
- multi objective
- greedy algorithm
- evolutionary algorithm
- average case
- objective function
- upper bound
- error bounds
- social welfare
- worst case analysis
- np hard
- lower bound
- resource allocation
- combinatorial optimization
- approximation algorithms
- theoretical guarantees
- running times
- submodular functions
- online learning
- nash equilibrium
- computational complexity
- database