Login / Signup
Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders.
Shahar Dobzinski
Published in:
CoRR (2016)
Keyphrases
</>
combinatorial auctions
mechanism design
winner determination
resource allocation
greedy algorithm
approximation algorithms
multi unit
worst case
single item
multi item
objective function
special case
auction mechanisms
mathematical programming
computational complexity
bidding strategies
autonomous agents
np hard