Robust competitive ratio for deterministic monopoly pricing
From MaRDI portal
Cites work
- A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions
- Distributionally robust optimization for sequential decision-making
- General restrictions on tail probabilities
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- scientific article; zbMATH DE number 3130649 (Why is no real title available?)
- scientific article; zbMATH DE number 4207454 (Why is no real title available?)
- Moments of non-negative mass
- On duality theory of conic linear problems.
- On the heavy-tail behavior of the distributionally robust newsvendor
- Optimal Auction Design
- Optimal selling mechanisms under moment conditions
- Robust monopoly pricing
- Semi-online two-level supply chain scheduling problems
- Static pricing guarantees for queueing systems
- Supply chain management with online customer selection
- Tight tail probability bounds for distribution-free decision making
This page was built for publication: Robust competitive ratio for deterministic monopoly pricing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314145)