-
1
-
-
33244485448
-
On Nash equilibria for a network creation game
-
DOI 10.1145/1109557.1109568, Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms
-
Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, pp. 89-98 (2006) (Pubitemid 43275228)
-
(2006)
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 89-98
-
-
Albers, S.1
Eilts, S.2
Even-Dar, E.3
Mansour, Y.4
Roditty, L.5
-
2
-
-
0036149420
-
Networks on chips: A new SoC paradigm
-
DOI 10.1109/2.976921
-
Benini, L., De Micheli, G.: Networks on chips: A new SoC paradigm. Computer 35(1), 70-78 (2002) (Pubitemid 34069383)
-
(2002)
Computer
, vol.35
, Issue.1
, pp. 70-78
-
-
Benini, L.1
De Micheli, G.2
-
4
-
-
77954653484
-
The price of anarchy in cooperative network creation games
-
December
-
Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The price of anarchy in cooperative network creation games. SIGecom Exchanges 8(2) (December 2009)
-
(2009)
SIGecom Exchanges
, vol.8
, Issue.2
-
-
Demaine, E.D.1
Hajiaghayi, M.T.2
Mahini, H.3
Zadimoghaddam, M.4
-
5
-
-
36849034429
-
The price of anarchy in network creation games
-
DOI 10.1145/1281100.1281142, PODC'07: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing
-
Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proceedings of the 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 292-298 (2007); To appear in ACM Transactions on Algorithms (Pubitemid 350229326)
-
(2007)
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
, pp. 292-298
-
-
Demaine, E.D.1
Hajiaghayi, M.2
Mahini, H.3
Zadimoghaddam, M.4
-
6
-
-
1142293089
-
On a network creation game
-
Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing, Boston, MA, pp. 347-351 (2003)
-
(2003)
Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing, Boston, MA
, pp. 347-351
-
-
Fabrikant, A.1
Luthra, A.2
Maneva, E.3
Papadimitriou, C.H.4
Shenker, S.5
-
7
-
-
0032108328
-
A threshold of ln n for approximating set cover
-
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634-652 (1998)
-
(1998)
Journal of the ACM
, vol.45
, Issue.4
, pp. 634-652
-
-
Feige, U.1
-
10
-
-
57549104177
-
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
-
Laoutaris, N., Poplawski, L., Rajaraman, R., Sundaram, R., Teng, S.-H.: Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, pp. 165-174 (2008)
-
(2008)
Proceedings of the 27th ACM Symposium on Principles of Distributed Computing
, pp. 165-174
-
-
Laoutaris, N.1
Poplawski, L.2
Rajaraman, R.3
Sundaram, R.4
Teng, S.-H.5
-
11
-
-
70350594729
-
Minimizing average shortest path distances via shortcut edge addition
-
Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, Heidelberg
-
Meyerson, A., Tagiku, B.: Minimizing average shortest path distances via shortcut edge addition. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. LNCS, vol. 5687, pp. 272-285. Springer, Heidelberg (2009)
-
(2009)
LNCS
, vol.5687
, pp. 272-285
-
-
Meyerson, A.1
Tagiku, B.2
|