On the hardness of pricing loss-leaders
From MaRDI portal
Publication:5743433
zbMATH Open1422.68093MaRDI QIDQ5743433FDOQ5743433
Authors: Preyas Popat, Yi Wu 
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095176
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Microeconomic theory (price theory and economic markets) (91B24)
Cites Work
- On the complexity of the highway pricing problem
- On profit-maximizing envy-free pricing
- Single-minded unlimited supply pricing on sparse instances
- A sublogarithmic approximation for highway and tollbooth pricing
- On profit-maximizing pricing for the highway and tollbooth problems
- Pricing on paths: a PTAS for the highway problem
- Algorithms and Data Structures
- Some optimal inapproximability results
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Conditional Hardness for Approximate Coloring
- On the power of unique 2-prover 1-round games
- Geometric bounds on the Ornstein-Uhlenbeck velocity process
- Approximation algorithms and online mechanisms for item pricing
- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
- On Hardness of Pricing Items for Single-Minded Bidders
- Two-query PCP with subconstant error
- How to Sell a Graph: Guidelines for Graph Retailers
- Combination can be hard
- Pricing loss leaders can be hard
- Hardness of MAX-2Lin and MAX-3Lin over integers, reals, and large cyclic groups
Cited In (5)
This page was built for publication: On the hardness of pricing loss-leaders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743433)
