Optimal bundle pricing with monotonicity constraint (Q957368): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57338962, #quickstatements; #temporary_batch_1714633800427
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing mechanism design to algorithm design via machine learning / 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: Combination can be hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Sell a Graph: Guidelines for Graph Retailers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle Pricing with Comparable Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bundle pricing with monotonicity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank

Revision as of 20:29, 28 June 2024

scientific article
Language Label Description Also known as
English
Optimal bundle pricing with monotonicity constraint
scientific article

    Statements

    Optimal bundle pricing with monotonicity constraint (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 November 2008
    0 references
    bundle pricing
    0 references
    revenue optimization
    0 references
    monotonicity
    0 references
    computational complexity
    0 references
    approximation algorithm
    0 references

    Identifiers