1. Lecture Notes in Computer Science;D. Biló,2008
2. Biló, D., Gualà, L., Proietti, G.: Hardness of an asymmetric 2-player Stackelberg network pricing game. In: Electronic Colloquium on Computational Complexity (ECCC), TR09-112 (November 3, 2009)
3. Briest, P., Hoefer, M., Krysta, P.: Stackelberg network pricing games. In: Proc. of the 25th Ann. Symp. on Theoretical Aspects of Computer Science (STACS), pp. 133–142 (2008), http://drops.dagstuhl.de/opus/volltexte/2008/1340
4. Lecture Notes in Computer Science;P. Briest,2009
5. Cardinal, J., Demaine, E.D., Fiorini, S., Joret, G., Langerman, S., Newman, I., Weimann, O.: The Stackelberg minimum spanning tree game. Algorithmica (2009), doi:10.1007/s00453-009-9299-y