Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for all Distributions.
Meryem EssaidiMatheus V. X. FerreiraS. Matthew WeinbergPublished in: CoRR (2022)
Keyphrases
- single item
- combinatorial auctions
- winner determination
- lot sizing
- infinite horizon
- batch size
- lead time
- upper bound
- joint replenishment
- finite horizon
- long run
- multi item
- dynamic programming
- special case
- optimal control
- stochastic demand
- optimal solution
- worst case
- holding cost
- incentive compatibility
- replenishment policy
- inventory systems
- asymptotically optimal
- probability distribution
- lower bound