Single-minded unlimited supply pricing on sparse instances
From MaRDI portal
Publication:3583426
DOI10.1145/1109557.1109678zbMath1192.91088OpenAlexW4252627820MaRDI QIDQ3583426
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109678
Related Items
On revenue maximization with sharp multi-unit demands ⋮ Graph pricing with limited supply ⋮ Envy-free pricing with general supply constraints for unit demand consumers ⋮ Pricing loss leaders can be hard ⋮ On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer ⋮ Pricing commodities ⋮ Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets ⋮ The Stackelberg minimum spanning tree game ⋮ Stackelberg network pricing games ⋮ Unnamed Item ⋮ An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph ⋮ On stackelberg pricing with computationally bounded customers ⋮ Optimal bundle pricing with monotonicity constraint ⋮ Reducing mechanism design to algorithm design via machine learning ⋮ On the complexity of the highway problem ⋮ Online pricing for multi-type of items ⋮ Unnamed Item ⋮ Price strategy implementation ⋮ Optimal pricing of capacitated networks ⋮ Models and algorithms for the product pricing with single-minded customers requesting bundles ⋮ On envy-free revenue approximation for combinatorial buyers with budgets ⋮ Pricing on Paths: A PTAS for the Highway Problem ⋮ On fair price discrimination in multi-unit markets ⋮ Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets ⋮ Envy-free pricing in multi-item markets ⋮ Unnamed Item
