Author:
Feldotto Matthias,Gairing Martin,Kotsialou Grammateia,Skopalik Alexander
Publisher
Springer International Publishing
Reference28 articles.
1. Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 25:1–25:22 (2008)
2. Ackermann, H., Skopalik, A.: Complexity of pure Nash equilibria in player-specific network congestion games. Internet Math. 5(4), 323–342 (2008)
3. Lecture Notes in Computer Science;S Aland,2006
4. Aziz, H., de Keijzer, B.: Shapley meets shapley. In: Mayr, E.W., Portier, N. (eds.) 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, 5–8 March 2014, Lyon, France. LIPIcs, vol. 25, pp. 99–111. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)
5. Bachrach, Y., Markakis, E., Resnick, E., Procaccia, A.D., Rosenschein, J.S., Saberi, A.: Approximating power indices: theoretical and empirical analysis. Auton. Agent. Multi-Agent Syst. 20(2), 105–122 (2010)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献