Separation in distributionally robust monopolist problem
From MaRDI portal
Publication:6609172
DOI10.1007/978-3-031-48974-7_31MaRDI QIDQ6609172
Publication date: 20 September 2024
Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)
Cites Work
- Title not available (Why is that?)
- Robust screening under ambiguity
- Robust monopoly pricing
- Optimal selling mechanisms under moment conditions
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Robust multidimensional pricing: separation without regret
- Correlation-robust auction design
- Frameworks and results in distributionally robust optimization
- A survey on the continuous nonlinear resource allocation problem
- Multidimensional mechanism design: revenue maximization and the multiple-good monopoly
- Distributionally robust pricing in independent private value auctions
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Optimal Auction Design
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Maximal revenue with multiple goods: Nonmonotonicity and other observations
- Robustness and Separation in Multidimensional Screening
- Robust Mechanisms Under Common Valuation
- The Discrete Moment Problem with Nonconvex Shape Constraints
- Quantifying Distributional Model Risk via Optimal Transport
- Correlation-Robust Analysis of Single Item Auction
- Optimal Design for Multi-Item Auctions: A Robust Optimization Approach
- 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)
