Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for All Distributions.
Meryem EssaidiMatheus V. X. FerreiraS. Matthew WeinbergPublished in: ITCS (2022)
Keyphrases
- single item
- combinatorial auctions
- winner determination
- lot sizing
- lead time
- infinite horizon
- long run
- batch size
- multi item
- upper bound
- inventory systems
- stochastic demand
- joint replenishment
- periodic review
- holding cost
- replenishment policy
- mechanism design
- finite horizon
- incentive compatibility
- hypervolume indicator
- resource allocation
- multistage
- random variables
- worst case
- probability distribution
- special case
- online auctions
- optimal control
- supply chain
- dynamic programming
- bayesian networks