Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing.
Piotr KrystaPublished in: MFCS (2005)
Keyphrases
- combinatorial auctions
- approximation algorithms
- winner determination
- multi unit
- multi unit combinatorial auctions
- resource allocation
- greedy algorithm
- multi item
- special case
- mechanism design
- auction protocol
- single item
- linear programming
- search algorithm
- mathematical programming
- dynamic programming
- worst case
- cooperative
- set covering
- auction mechanisms
- reinforcement learning
- lower bound
- search space
- genetic algorithm
- np hard
- upper bound