Worst case compromises in matroids with applications to the allocation of indivisible goods.
Laurent GourvèsJérôme MonnotLydia TlilanePublished in: Theor. Comput. Sci. (2015)
Keyphrases
- envy free
- worst case
- combinatorial auctions
- multi unit
- resource allocation
- optimal allocation
- pareto optimal
- approximation algorithms
- utility function
- average case
- social welfare
- greedy algorithm
- upper bound
- lower bound
- error bounds
- independent set
- submodular functions
- np hard
- auction mechanisms
- nash equilibrium
- multi objective
- data sets
- worst case analysis
- space complexity
- computational complexity
- neural network
- theoretical guarantees
- running times
- game theory
- dynamic programming
- constant factor
- resource allocation problems
- objective function