Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference22 articles.
1. Angelidakis, H., Fotakis, D., Lianeas, T.: Stochastic congestion games with risk-averse players. In: Proc. of the 6th international symposium on algorithmic game theory (SAGT ’13), vol. 8146 of LNCS, pp. 86–97 (2013)
2. Bonifaci, V., Salek, M., Schäfer, G.: Efficiency of restricted tolls in non-atomic network routing games. In: Proceedings of the 4th international symposium on algorithmic game theory (SAGT ’10), volume 6982 of LNCS, pp. 302–313. Springer-Verlag (2011)
3. Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Selfish routing in capacitated networks. Math. Oper. Res. 29(4), 961–976 (2004)
4. Fiat, A., Papadimitriou, C.H.: When the players are not expectation maximizers. In: Proceedings of the 3th international symposium on algorithmic game theory (SAGT ’10), volume 6386 of LNCS, pp. 1–14 (2010)
5. Fleischer, L.: Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks. Theor. Comput. Sci. 348, 217–225 (2005)