Pricing loss leaders can be hard (Q2637290): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q2921790 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single-minded unlimited supply pricing on sparse instances / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3002785 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combination can be hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Hardness of Pricing Items for Single-Minded Bidders / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the power of unique 2-prover 1-round games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank | |||
Normal rank |
Latest revision as of 07:55, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pricing loss leaders can be hard |
scientific article |
Statements
Pricing loss leaders can be hard (English)
0 references
11 February 2014
0 references
complexity theory
0 references
game theory
0 references
approximation algorithm
0 references
unique games conjecture
0 references