On the public citation graph

Robust Multidimensional Pricing: Separation Without Regret

https://doi.org/10.1007/s10107-021-01615-4
0 signed · 65 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s10058-010-0104-9openalex-snapshot
Bidder collusion at first-price auctions
inferredcites →https://doi.org/10.1007/s10107-012-0559-2openalex-snapshot
Optimization and mechanism design
inferredcites →https://doi.org/10.1007/s10107-016-1063-xopenalex-snapshot
Robust screening under ambiguity
inferredcites →https://doi.org/10.1016/0022-0531(83)90048-0openalex-snapshot
Efficient mechanisms for bilateral trading
inferredcites →https://doi.org/10.1016/j.ejor.2018.07.027openalex-snapshot
Robust strategic bidding in auction-based markets
inferredcites →https://doi.org/10.1016/j.jet.2003.09.002openalex-snapshot
Haggling over substitutes
inferredcites →https://doi.org/10.1016/j.jet.2005.08.007openalex-snapshot
Bundling as an optimal selling mechanism for a multiple-good monopolist
inferredcites →https://doi.org/10.1016/j.jet.2011.10.018openalex-snapshot
Robust monopoly pricing
inferredcites →https://doi.org/10.1016/j.jet.2017.09.001openalex-snapshot
Approximate revenue maximization with multiple items
inferredcites →https://doi.org/10.1016/j.jet.2018.05.005openalex-snapshot
Optimal selling mechanisms under moment conditions
inferredcites →https://doi.org/10.1017/9781316779873openalex-snapshot
Market Design
inferredcites →https://doi.org/10.1073/pnas.1309533110openalex-snapshot
On revenue maximization for selling multiple independently distributed items
inferredcites →https://doi.org/10.1080/01621459.1951.10500768openalex-snapshot
The Theory of Statistical Decision
inferredcites →https://doi.org/10.1090/s0273-0979-2013-01423-xopenalex-snapshot
Euler’s constant: Euler’s work and modern developments
inferredcites →https://doi.org/10.1137/080734510openalex-snapshot
Theory and Applications of Robust Optimization
inferredcites →https://doi.org/10.1137/1.9781611973402.96openalex-snapshot
The Complexity of Optimal Mechanism Design
inferredcites →https://doi.org/10.1137/1.9781611975031.135openalex-snapshot
Separation in Correlation-Robust Monopolist Problem with Budget
inferredcites →https://doi.org/10.1137/120864015openalex-snapshot
Pessimistic Bilevel Optimization
inferredcites →https://doi.org/10.1142/9789814374590_0012openalex-snapshot
Pricing Without Priors
inferredcites →https://doi.org/10.1145/2482540.2482593openalex-snapshot
Mechanism design via optimal transport
inferredcites →https://doi.org/10.1145/2492002.2482544openalex-snapshot
The menu-size complexity of auctions
inferredcites →https://doi.org/10.1145/2492002.2482593openalex-snapshot
Mechanism design via optimal transport
inferredcites →https://doi.org/10.1145/2600057.2602883openalex-snapshot
Duality and optimality of auctions for uniform distributions
inferredcites →https://doi.org/10.1287/mnsc.1120.1663openalex-snapshot
Mixed Bundling of Two Independently Valued Goods
inferredcites →https://doi.org/10.1287/moor.2014.0645openalex-snapshot
Optimal Design for Multi-Item Auctions: A Robust Optimization Approach
inferredcites →https://doi.org/10.1287/moor.6.1.58openalex-snapshot
Optimal Auction Design
inferredcites →https://doi.org/10.1515/9781400831050openalex-snapshot
Robust Optimization
inferredcites →https://doi.org/10.2307/1885625openalex-snapshot
Optimal Selling Strategies: When to Haggle, When to Hold Firm
inferredcites →https://doi.org/10.3982/ecta12618openalex-snapshot
Strong Duality for a Multiple-Good Monopolist
inferredcites →https://doi.org/10.3982/ecta14165openalex-snapshot
Robustness and Separation in Multidimensional Screening

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.3090002openalex-extracted
inferred← citeshttps://doi.org/10.2139/ssrn.3636395openalex-extracted
inferred← citeshttps://doi.org/10.2139/ssrn.3707021openalex-extracted
Minimax Regret Robust Screening with Moments Information
inferred← citeshttps://doi.org/10.2139/ssrn.3759397openalex-extracted
Model-Free Assortment Pricing with Transaction Data
inferred← citeshttps://doi.org/10.2139/ssrn.3821382openalex-extracted
inferred← citeshttps://doi.org/10.2139/ssrn.3940212openalex-extracted
Screening with Limited Information: The Minimax Theorem and a Geometric Approach
inferred← citeshttps://doi.org/10.2139/ssrn.4090071openalex-extracted
On the Robustness of Second-Price Auctions in Prior-Independent Mechanism Design
inferred← citeshttps://doi.org/10.2139/ssrn.4169471openalex-extracted
inferred← citeshttps://doi.org/10.2139/ssrn.4284585openalex-extracted
Distributionally Robust Optimal Allocation with Costly Verification
inferred← citeshttps://doi.org/10.2139/ssrn.4449366openalex-extracted
Robust Auction Design with Support Information
inferred← citeshttps://doi.org/10.2139/ssrn.4594791openalex-extracted
inferred← citeshttps://doi.org/10.2139/ssrn.4731184openalex-extracted
Robust Optimal Selling Mechanism under Non-linear Utility
inferred← citeshttps://doi.org/10.2139/ssrn.4759889openalex-extracted
The Best of Many Robustness Criteria in Decision Making: Formulation and Application to Robust Pricing
inferred← citeshttps://doi.org/10.1007/978-3-031-48974-7_31openalex-snapshot
Separation in Distributionally Robust Monopolist Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-48974-7_32openalex-snapshot
Target-Oriented Regret Minimization for Satisficing Monopolists
inferred← citeshttps://doi.org/10.1007/s10107-022-01876-7openalex-snapshot
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.01.050openalex-snapshot
Monotonicity of equilibria in nonatomic congestion games
inferred← citeshttps://doi.org/10.1093/restud/rdae107openalex-snapshot
Robustly Optimal Mechanisms for Selling Multiple Goods
inferred← citeshttps://doi.org/10.1145/3465456.3467570openalex-snapshot
Robustly-Optimal Mechanism for Selling Multiple Goods
inferred← citeshttps://doi.org/10.1177/10591478251355587openalex-snapshot
Robust Monopoly Pricing With Asymmetric Information
inferred← citeshttps://doi.org/10.1287/ijoc.2022.0275openalex-snapshot
Regret Minimization and Separation in Multi-Bidder Multi-Item Auctions
inferred← citeshttps://doi.org/10.1287/mnsc.2022.4603openalex-snapshot
Incentive-Compatible Assortment Optimization for Sponsored Products
inferred← citeshttps://doi.org/10.1287/mnsc.2022.4651openalex-snapshot
Model-Free Assortment Pricing with Transaction Data
inferred← citeshttps://doi.org/10.1287/mnsc.2023.03738openalex-snapshot
The Power of Simple Menus in Robust Selling Mechanisms
inferred← citeshttps://doi.org/10.1287/moor.2024.0707openalex-snapshot
Simple and Effective: A Deterministic Auction with Support Information
inferred← citeshttps://doi.org/10.1287/msom.2021.1055openalex-snapshot
Distribution-Free Pricing
inferred← citeshttps://doi.org/10.1287/msom.2023.0072openalex-snapshot
Minimax Regret Robust Screening with Moment Information
inferred← citeshttps://doi.org/10.1287/opre.2022.0016openalex-snapshot
Screening with Limited Information: A Dual Perspective
inferred← citeshttps://doi.org/10.1287/opre.2022.0428openalex-snapshot
On the Robustness of Second-Price Auctions in Prior-Independent Mechanism Design
inferred← citeshttps://doi.org/10.1287/opre.2022.0662openalex-snapshot
Distributionally Robust Optimal Allocation with Costly Verification
inferred← citeshttps://doi.org/10.1287/opre.2022.2429openalex-snapshot
Technical Note—Risk-Averse Regret Minimization in Multistage Stochastic Programs
inferred← citeshttps://doi.org/10.1287/opre.2023.0138openalex-snapshot
Nash Equilibria, Regularization, and Computation in Optimal Transport-Based Distributionally Robust Optimization
inferred← citeshttps://doi.org/10.2139/ssrn.5130478openalex-snapshot
Optimal Competitive Ratio in Opaque Sales
inferred← citeshttps://doi.org/10.2139/ssrn.5378197openalex-snapshot
Tractable Robust Mechanism Design with General Concave Objectives
inferred← citeshttps://doi.org/10.48550/arxiv.2101.02251openalex-snapshot
Model-Free Assortment Pricing with Transaction Data
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.