Combinatorial auctions with verification are tractable.
Piotr KrystaCarmine VentrePublished in: Theor. Comput. Sci. (2015)
Keyphrases
- combinatorial auctions
- winner determination
- resource allocation
- multi item
- mechanism design
- approximation algorithms
- multi unit
- single item
- multi unit combinatorial auctions
- np hard
- set covering
- special case
- model checking
- auction mechanisms
- computational complexity
- auction protocol
- cost function
- multi objective
- lower bound