Author:
Chalermsook Parinya,Chuzhoy Julia,Kannan Sampath,Khanna Sanjeev
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Lecture Notes in Computer Science;G. Aggarwal,2004
2. Balcan, M.-F., Blum, A.: Approximation algorithms and online mechanisms for item pricing. Theory of Computing 3(1), 179–195 (2007)
3. Lecture Notes in Computer Science;P. Briest,2008
4. Briest, P., Krysta, P.: Buying cheap is expensive: hardness of non-parametric multi-product pricing. In: SODA, pp. 716–725 (2007)
5. Lecture Notes in Computer Science;N. Chen,2010
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimal Subscription Planning for Digital Goods;Operations Research;2023-11
2. Pricing ordered items;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. A QPTAS for ɛ-Envy-Free Profit-Maximizing Pricing on Line Graphs;ACM Transactions on Economics and Computation;2021-09-30
4. Graph Pricing with Limited Supply;Lecture Notes in Computer Science;2021
5. On fair price discrimination in multi-unit markets;Artificial Intelligence;2021-01