Author:
Briest Patrick,Chalermsook Parinya,Khanna Sanjeev,Laekhanukit Bundit,Nanongkai Danupon
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Lecture Notes in Computer Science;G. Aggarwal,2004
2. Arora, S., Lund, C.: Hardness Of Approximations. In: Approximation Algorithms for NP-hard Problems. PWS Publishing Company (1996)
3. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof Verification and Hardness of Approximation Problems. Journal of the ACM 45(3), 501–555 (1998)
4. Balcan, N., Blum, A., Mansour, Y.: Item Pricing for Revenue Maximization. In: Proc. of 9th EC (2008)
5. Lecture Notes in Computer Science;P. Briest,2008
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stackelberg packing games;Theoretical Computer Science;2023-01
2. Stackelberg Vertex Cover on a Path;Algorithmic Game Theory;2023
3. Stackelberg Max Closure with Multiple Followers;Mathematics of Operations Research;2022-11
4. Negative prices in network pricing games;Operations Research Letters;2022-03
5. Stackelberg Packing Games;SSRN Electronic Journal;2022