An O(log log m) prophet inequality for subadditive combinatorial auctions.
Paul DüttingThomas KesselheimBrendan LucierPublished in: SIGecom Exch. (2020)
Keyphrases
- combinatorial auctions
- log log
- positive integer
- winner determination
- resource allocation
- approximation algorithms
- single item
- multi unit combinatorial auctions
- multi unit
- mechanism design
- mixed integer
- auction mechanisms
- affine invariance
- undirected graph
- mathematical programming
- strategy proof
- computational complexity
- social networks
- bidding strategies
- affine invariant
- frequency domain
- random walk
- optimal solution