Author:
Bilò Davide,Gualà Luciano,Leucci Stefano,Proietti Guido
Funder
Italian Ministry of Education, University, and Research
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. Some APX-completeness results for cubic graphs;Alimonti;Theoret. Comput. Sci.,2000
2. Computational aspects of a 2-player Stackelberg shortest paths tree game;Bilò,2008
3. Hardness of an asymmetric 2-player Stackelberg network pricing game;Bilò,2009
4. Stackelberg network pricing games;Briest;Algorithmica,2012
5. On Stackelberg pricing with computational bounded consumers;Briest;Networks,2012
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献