Separation in distributionally robust monopolist problem
From MaRDI portal
Cites work
- A survey on the continuous nonlinear resource allocation problem
- Correlation-robust analysis of single item auction
- Correlation-robust auction design
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Distributionally robust pricing in independent private value auctions
- Frameworks and results in distributionally robust optimization
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Maximal revenue with multiple goods: Nonmonotonicity and other observations
- Multidimensional mechanism design: revenue maximization and the multiple-good monopoly
- Optimal Auction Design
- Optimal design for multi-item auctions: a robust optimization approach
- Optimal selling mechanisms under moment conditions
- Quantifying distributional model risk via optimal transport
- Robust Mechanisms Under Common Valuation
- Robust monopoly pricing
- Robust multidimensional pricing: separation without regret
- Robust screening under ambiguity
- Robustness and separation in multidimensional screening
- Separation in correlation-robust monopolist problem with budget
- The Discrete Moment Problem with Nonconvex Shape Constraints
- The complexity of optimal mechanism design
This page was built for publication: Separation in distributionally robust monopolist problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609172)
