{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:07:43Z","timestamp":1748664463871,"version":"3.41.0"},"publisher-location":"Cham","reference-count":83,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319240237"},{"type":"electronic","value":"9783319240244"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24024-4_1","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T12:00:10Z","timestamp":1441368010000},"page":"3-24","source":"Crossref","is-referenced-by-count":0,"title":["A Glimpse at Paul G. Spirakis"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Chatzigiannakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Fotakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spyros","family":"Kontogiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Othon","family":"Michail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sotiris","family":"Nikoletseas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grammati","family":"Pantziou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Akrida, E., Gasieniec, L., Mertzios, G., Spirakis, P.: Ephemeral networks with random availability of links: diameter and connectivity. In: Proceedings of 26th ACM Symposium on Parallelism in Algorithms and Architectures\u2014SPAA 2014, pp. 267\u2013276 (2014)","DOI":"10.1145\/2612669.2612693"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-45046-4_2","volume-title":"Web and Internet Economics","author":"Y Anbalagan","year":"2013","unstructured":"Anbalagan, Y., Norin, S., Savani, R., Vetta, A.: Polylogarithmic supports are required for approximate well-supported Nash equilibria below 2\/3. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 15\u201323. Springer, Heidelberg (2013)"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/PL00008270","volume":"24","author":"G Bilardi","year":"1999","unstructured":"Bilardi, G., Herley, K., Pietracaprina, A., Pucci, G., Spirakis, P.: BSP versus LogP. Algorithmica 24, 405\u2013422 (1999). Preliminary version in SPAA 1996","journal-title":"Algorithmica"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Cerf, V., Burleigh, S., Hooke, A., Torgerson, L., Durst, B., Scott, K., Fall, K., Weiss, H.: Delay-tolerant networking architecture. Technical report, The IETF Trust (2007)","DOI":"10.17487\/rfc4838"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1007\/978-3-540-45209-6_138","volume-title":"Euro-Par 2003 Parallel Processing","author":"I Chatzigiannakis","year":"2003","unstructured":"Chatzigiannakis, I., Dimitriou, T.D., Mavronicolas, M., Nikoletseas, S.E., Spirakis, P.G.: A comparative study of protocols for efficient data propagation in smart dust networks. In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 1003\u20131016. Springer, Heidelberg (2003)"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1142\/S0129626403001550","volume":"13","author":"I Chatzigiannakis","year":"2003","unstructured":"Chatzigiannakis, I., Dimitriou, T., Mavronicolas, M., Nikoletseas, S., Spirakis, P.: A comparative study of protocols for efficient data propagation in smart dust networks. Parallel Process. Lett. 13(4), 615\u2013627 (2003)","journal-title":"Parallel Process. Lett."},{"issue":"46","key":"1_CR8","doi-asserted-by":"publisher","first-page":"6469","DOI":"10.1016\/j.tcs.2011.07.001","volume":"412","author":"I Chatzigiannakis","year":"2011","unstructured":"Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.: Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412(46), 6469\u20136483 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-44688-5_13","volume-title":"Algorithm Engineering","author":"I Chatzigiannakis","year":"2001","unstructured":"Chatzigiannakis, I., Nikoletseas, S.E., Paspallis, N., Spirakis, P.G., Zaroliagis, C.D.: An experimental study of basic communication protocols in ad-hoc mobile networks. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol. 2141, pp. 159\u2013171. Springer, Heidelberg (2001)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Smart dust protocols for local detection and propagation. In: Proceedings of 2nd ACM International Workshop on Principles of Mobile Computing\u2014POMC 2002, pp. 9\u201316 (2002)","DOI":"10.1145\/584491.584493"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/S0743-7315(02)00034-5","volume":"63","author":"I Chatzigiannakis","year":"2003","unstructured":"Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Distributed communication algorithms for ad hoc mobile networks. J. Parallel Distrib. Comput. 63(1), 58\u201374 (2003)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56, 3, Art. No. 14 (2009)","DOI":"10.1145\/1516512.1516516"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00453-010-9449-2","volume":"61","author":"G Christodoulou","year":"2011","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.: On the performance of approximate equilibria in congestion games. Algorithmica 61(1), 116\u2013140 (2011)","journal-title":"Algorithmica"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-662-47672-7_32","volume-title":"Automata, Languages, and Programming","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Ga\u0327sieniec, L., Kosowski, A., Kranakis, E., Spirakis, P.G., Uzna\u0144ski, P.: On convergence and threshold properties of discrete Lotka-Volterra population protocols. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 393\u2013405. Springer, Heidelberg (2015)"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195\u2013259 (2009). Preliminary version in ACM STOC 2006","journal-title":"SIAM J. Comput."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11944874_27","volume-title":"Internet and Network Economics","author":"C Daskalakis","year":"2006","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 297\u2013306. Springer, Heidelberg (2006)"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s00453-012-9722-7","volume":"69","author":"J D\u00edaz","year":"2014","unstructured":"D\u00edaz, J., Goldberg, L.A., Mertzios, G.B., Richerby, D., Serna, M.J., Spirakis, P.: Approximating fixation probabilities in the generalized Moran process. Algorithmica 69(1), 78\u201391 (2014). Preliminary version in SODA 2012","journal-title":"Algorithmica"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Diaz, J., Koukopoulos, D., Nikoletseas, S., Spirakis, P., Serna, M., Thilikos, D.: Stability and instability of the FIFO protocol. In: Proceedings of 13th ACM Symposium on Parallel Algorithms and Architectures\u2014SPAA 2001, pp. 48\u201352 (2001)","DOI":"10.1145\/378580.378588"},{"issue":"1\u20132","key":"1_CR19","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(97)00297-1","volume":"201","author":"J D\u00edaz","year":"1998","unstructured":"D\u00edaz, J., Serna, M.J., Spirakis, P.: On the random generation and counting of matchings in dense graphs. Theor. Comput. Sci. 201(1\u20132), 281\u2013290 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1007\/978-3-540-24693-0_110","volume-title":"NETWORKING 2004. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications","author":"TD Dimitriou","year":"2004","unstructured":"Dimitriou, T.D., Krontiris, I., Nikakis, F., Spirakis, P.G.: SPEED: Scalable Protocols for Efficient Event Delivery in sensor networks. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 1300\u20131305. Springer, Heidelberg (2004)"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"173232","DOI":"10.1007\/s002240010002","volume":"33","author":"P Fatourou","year":"2000","unstructured":"Fatourou, P., Spirakis, P.: Efficient scheduling of strict multithreaded computations. Theory Comput. Syst. 33(3), 173232 (2000)","journal-title":"Theory Comput. Syst."},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-33996-7_10","volume-title":"Algorithmic Game Theory","author":"J Fearnley","year":"2012","unstructured":"Fearnley, J., Goldberg, P.W., Savani, R., S\u00f8rensen, T.B.: Approximate well-supported Nash equilibria below two-thirds. In: Serna, M. (ed.) SAGT 2012. LNCS, vol. 7615, pp. 108\u2013119. Springer, Heidelberg (2012)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Fearnley, J., Igwe, T.P., Savani, R.: An empirical study of finding approximate equilibria in bimatrix games. ArXiv\/CoRR, abs\/1502.04980 (2015)","DOI":"10.1007\/978-3-319-20086-6_26"},{"issue":"3","key":"1_CR24","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00224-011-9355-2","volume":"50","author":"D Fotakis","year":"2012","unstructured":"Fotakis, D., Gkatzelis, V., Kaporis, A., Spirakis, P.: The impact of social ignorance on weighted congestion games. Theory Comput, Syst. 50(3), 559\u2013578 (2012)","journal-title":"Theory Comput, Syst."},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.04.033","volume":"448","author":"D Fotakis","year":"2012","unstructured":"Fotakis, D., Kaporis, A., Spirakis, P.: Efficient methods for selfish network design. Theor. Comput. Sci. 448, 9\u201320 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. Theor. Comput. Sci. 348, 226\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"36","key":"1_CR27","doi-asserted-by":"publisher","first-page":"3305","DOI":"10.1016\/j.tcs.2008.01.004","volume":"410","author":"D Fotakis","year":"2009","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36), 3305\u20133326 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1383369.1383383","volume":"4","author":"D Fotakis","year":"2008","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Atomic congestion games among coalitions. ACM Trans. Algorithms 4, 4 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"1_CR29","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.tcs.2005.03.013","volume":"340","author":"D Fotakis","year":"2005","unstructured":"Fotakis, D., Nikoletseas, S., Papadopoulou, V., Spirakis, P.: Radiocoloring in planar graphs: complexity and approximations. Theor. Comput. Sci. 340(3), 514\u2013538 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-49382-2_3","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"DA Fotakis","year":"1998","unstructured":"Fotakis, D.A., Spirakis, P.G.: A Hamiltonian approach to the assignment of non-reusable frequencies. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 18\u201330. Springer, Heidelberg (1998)"},{"issue":"1","key":"1_CR31","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/s00224-011-9315-x","volume":"49","author":"T Harks","year":"2011","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.H.: Characterizing the existence of potential functions in weighted congestion games. Theory Comput. Syst. 49(1), 46\u201370 (2011)","journal-title":"Theory Comput. Syst."},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-48318-7_10","volume-title":"Algorithm Engineering","author":"K Hatzis","year":"1999","unstructured":"Hatzis, K., Pentaris, G., Spirakis, P.G., Tampakas, B.: Counting in mobile networks: theory and experimentation. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 95\u2013109. Springer, Heidelberg (1999)"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Hatzis, K., Pentaris, G., Spirakis, P., Tampakas, V., Tan, R.B.: Fundamental control algorithms in mobile networks. In: Proceedings of ACM SPAA 1999, pp. 251\u2013260 (1999)","DOI":"10.1145\/305619.305649"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/inco.1993.1041","volume":"105","author":"J Jung","year":"1993","unstructured":"Jung, J., Kirousis, L.M., Spirakis, P.: Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays. Inf. Comput. 105, 94\u2013104 (1993)","journal-title":"Inf. Comput."},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Kamath, A., Motwani, R., Palem, K., Spirakis, P.: Tail bounds for occupancy and the satisfiability threshold conjecture. In: Proceedings of 35th IEEE Symposium on Foundations of Computer Science\u2014FOCS 1994, pp. 592\u2013603 (1994)","DOI":"10.1109\/SFCS.1994.365732"},{"key":"1_CR36","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00199-009-0436-2","volume":"42","author":"R Kannan","year":"2010","unstructured":"Kannan, R., Theobald, T.: Games of fixed rank: a hierarchy of bimatrix games. Econ. Theory 42, 157\u2013173 (2010). Preliminary version in ACM-SIAM SODA 2007","journal-title":"Econ. Theory"},{"issue":"8\u201310","key":"1_CR37","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.tcs.2008.11.002","volume":"410","author":"A Kaporis","year":"2009","unstructured":"Kaporis, A., Spirakis, P.: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Theor. Comput. Sci. 410(8\u201310), 745\u2013755 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR38","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(96)00065-5","volume":"168","author":"D Kavvadias","year":"1996","unstructured":"Kavvadias, D., Pantziou, G., Spirakis, P., Zaroliagis, C.: Hammock-on-Ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems. Theor. Comput. Sci. 168(1), 121\u2013154 (1996). Preliminary version in MFCS 1994","journal-title":"Theor. Comput. Sci."},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Kedem, Z., Palem, K., Spirakis, P.G.: Efficient robust parallel computations. In: Proceedings of 22nd Annual ACM Symposium on Theory of Computing\u2014STOC 1990, pp. 138\u2013148 (1990)","DOI":"10.1145\/100216.100231"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of 32nd ACM Symposium on Theory of Computing\u2014STOC 2000, pp. 504\u2013513 (2000)","DOI":"10.1145\/335305.335364"},{"issue":"3","key":"1_CR41","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1137\/0222039","volume":"22","author":"L Kirousis","year":"1993","unstructured":"Kirousis, L., Serna, M., Spirakis, P.: The parallel complexity of the connected subgraph problem. SIAM J. Comput. 22(3), 573\u2013586 (1993). Preliminary version in FOCS 1989","journal-title":"SIAM J. Comput."},{"issue":"7","key":"1_CR42","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1109\/71.296315","volume":"5","author":"L Kirousis","year":"1994","unstructured":"Kirousis, L., Spirakis, P., Tsigas, P.: Reading many variables in one atomic operation solutions with linear or sublinear complexity. IEEE Trans. Parallel Distrib. Comput. 5(7), 688\u2013696 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Comput."},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/11944874_26","volume-title":"Internet and Network Economics","author":"SC Kontogiannis","year":"2006","unstructured":"Kontogiannis, S.C., Panagopoulou, P.N., Spirakis, P.G.: Polynomial algorithms for approximating nash equilibria of bimatrix games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 286\u2013296. Springer, Heidelberg (2006)"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-20662-7_1","volume-title":"Experimental Algorithms","author":"S Kontogiannis","year":"2011","unstructured":"Kontogiannis, S., Spirakis, P.: Approximability of symmetric bimatrix games and related experiments. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 1\u201320. Springer, Heidelberg (2011)"},{"issue":"4","key":"1_CR45","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s00224-004-1181-3","volume":"38","author":"D Koukopoulos","year":"2005","unstructured":"Koukopoulos, D., Mavronicolas, M., Nikoletseas, S., Spirakis, P.: The impact of network structure on the stability of greedy protocols. Theory Comput. Syst. 38(4), 425\u2013460 (2005)","journal-title":"Theory Comput. Syst."},{"key":"1_CR46","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-003-1131-5","volume":"36","author":"E Koutsoupias","year":"2003","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. Theory Comput. Syst. 36, 683\u2013693 (2003)","journal-title":"Theory Comput. Syst."},{"key":"#cr-split#-1_CR47.1","doi-asserted-by":"crossref","unstructured":"Kumar, B., Srikant, Y.N.: The best nurturers in computer science research. In: Proceedings of 2005 SIAM International Conference on Data Mining, pp. 566-570","DOI":"10.1137\/1.9781611972757.62"},{"key":"#cr-split#-1_CR47.2","unstructured":"also Technical Report IISc-CSA-TR-2004-10, Computer Science and Automation, Indian Institute of Science, India, October 2004"},{"issue":"3","key":"1_CR48","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-247X(64)90021-6","volume":"9","author":"OL Mangasarian","year":"1964","unstructured":"Mangasarian, O.L., Stone, H.: Two-person nonzero-sum games and quadratic programming. J. Math. Anal. Appl. 9(3), 348\u2013355 (1964)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"1_CR49","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00453-006-0056-1","volume":"48","author":"M Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Spirakis, P.: The price of selfish routing. Algorithmica 48(1), 91\u2013126 (2007)","journal-title":"Algorithmica"},{"key":"1_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-642-39212-2_57","volume-title":"Automata, Languages, and Programming","author":"GB Mertzios","year":"2013","unstructured":"Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 657\u2013668. Springer, Heidelberg (2013)"},{"key":"1_CR51","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2012.11.032","volume":"477","author":"GB Mertzios","year":"2013","unstructured":"Mertzios, G.B., Nikoletseas, S., Raptopoulos, C., Spirakis, P.: Natural models for evolution on networks. Theor. Comput. Sci. 477, 76\u201395 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1007\/978-3-662-43948-7_72","volume-title":"Automata, Languages, and Programming","author":"GB Mertzios","year":"2014","unstructured":"Mertzios, G.B., Nikoletseas, S.E., Raptopoulos, C.L., Spirakis, P.G.: Determining majority in networks with local interactions and very small local memory. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 871\u2013882. Springer, Heidelberg (2014)"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"Michail, O.: An introduction to temporal graphs\u2014an algorithmic perspective. In: Algorithms, Probability, Networks, and Games. LNCS, vol. 9295. Springer, New York (2015)","DOI":"10.1007\/978-3-319-24024-4_18"},{"key":"1_CR54","series-title":"Synthesis Lectures on Distributed Computing Theory","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02004-9","volume-title":"New Models for Population Protocols","author":"O Michail","year":"2011","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.: New Models for Population Protocols. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2011)"},{"issue":"22","key":"1_CR55","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1016\/j.tcs.2011.02.003","volume":"412","author":"O Michail","year":"2011","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.: Mediated population protocols. Theor. Comput. Sci. 412(22), 2434\u20132450 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-03089-0_20","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"O Michail","year":"2013","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Naming and counting in anonymous unknown dynamic networks. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol. 8255, pp. 281\u2013295. Springer, Heidelberg (2013)"},{"issue":"1","key":"1_CR57","doi-asserted-by":"publisher","first-page":"2016","DOI":"10.1016\/j.jpdc.2013.07.007","volume":"74","author":"O Michail","year":"2014","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.: Causality, influence, and computation in possibly disconnected synchronous dynamic networks. J. Parallel Distrib. Comput. 74(1), 2016\u20132026 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR58","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.: Computing in dynamic networks. In: Dehmer, M., Emmert-Streib, F., Pickl, S. (eds.) Chapter 6 in Computational Network Theory: Theoretical Foundations and Applications, 1st edn, pp. 173\u2013218, Wiley-VCH Verlag GmbH & Co. KGaA (2015)"},{"key":"1_CR59","doi-asserted-by":"crossref","unstructured":"Michail, O., Spirakis, P.: Simple and efficient local codes for distributed stable network construction. In: Proceedings of 33rd ACM Symposium on Principles of Distributed Computing\u2014PODC 2014, pp. 76\u201385 (2014)","DOI":"10.1145\/2611462.2611466"},{"key":"1_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/978-3-662-44465-8_47","volume-title":"Mathematical Foundations of Computer Science 2014","author":"O Michail","year":"2014","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 553\u2013564. Springer, Heidelberg (2014)"},{"key":"1_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2015.02.005","volume":"81","author":"O Michail","year":"2015","unstructured":"Michail, O., Spirakis, P.: Terminating population protocols via some minimal global knowledge assumptions. J. Parallel Distrib. Comput. 81, 1\u201310 (2015)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR62","doi-asserted-by":"crossref","unstructured":"Michail, O., Spirakis, P.: Distributed computation by connectivity preserving network transformers (2015) (to appear)","DOI":"10.1007\/978-3-319-46376-6_15"},{"issue":"3\u20134","key":"1_CR63","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01769190","volume":"7","author":"H Moulin","year":"1978","unstructured":"Moulin, H., Vial, J.P.: Strategically zero-sum games: the class of games whose completely mixed equilibria cannot be improved upon. Int. J. Game Theory 7(3\u20134), 201\u2013221 (1978)","journal-title":"Int. J. Game Theory"},{"key":"1_CR64","doi-asserted-by":"publisher","first-page":"289","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Noncooperative games. Ann. Math. 54, 289\u2013295 (1951)","journal-title":"Ann. Math."},{"key":"1_CR65","doi-asserted-by":"crossref","unstructured":"Nikoletseas, S., Palem, K.V., Spirakis, P., Yung, M.: Short vertex disjoint paths and multiconnectivity in random graphs: reliable network computing. In: Proceedings of 21st International Colloquium on Automata, Languages and Programming\u2014ICALP 1994, pp. 508\u2013519 (1994)","DOI":"10.1007\/3-540-58201-0_94"},{"key":"1_CR66","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s00224-003-1087-5","volume":"36","author":"S Nikoletseas","year":"2003","unstructured":"Nikoletseas, S., Prasinos, G., Spirakis, P., Zaroliagis, C.: Attack propagation in networks. Theory Comput. Syst. 36, 553\u2013574 (2003). Preliminary version in ACM SPAA 2001","journal-title":"Theory Comput. Syst."},{"key":"1_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1007\/978-3-540-27836-8_86","volume-title":"Automata, Languages and Programming","author":"SE Nikoletseas","year":"2004","unstructured":"Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: The existence and efficient construction of large independent sets in general random intersection graphs. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1029\u20131040. Springer, Heidelberg (2004)"},{"key":"1_CR68","first-page":"1","volume":"11","author":"P Panagopoulou","year":"2006","unstructured":"Panagopoulou, P., Spirakis, P.: Algorithms for pure Nash equilibria in weighted congestion games. ACM J. Exp. Algorithmics 11, 1\u201319 (2006)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"3","key":"1_CR69","first-page":"479","volume":"54","author":"P Panagopoulou","year":"2014","unstructured":"Panagopoulou, P., Spirakis, P.: Random bimatrix games are asymptotically easy to solve (A simple proof). Theor. Comput. Sci. 54(3), 479\u2013490 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR70","doi-asserted-by":"crossref","unstructured":"Pantziou, G., Pentaris, G., Spirakis, P.: Competitive call control in mobile networks. In: Algorithms and Computation\u2014ISAAC 1997, pp. 404\u2013413 (1997)","DOI":"10.1007\/3-540-63890-3_43"},{"issue":"2","key":"1_CR71","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01994878","volume":"32","author":"G Pantziou","year":"1992","unstructured":"Pantziou, G., Spirakis, P., Zaroliagis, C.: Efficient parallel algorithms for shortest paths in planar digraphs. BIT 32(2), 215\u2013236 (1992). Preliminary vesrion in SWAT 1990","journal-title":"BIT"},{"key":"1_CR72","doi-asserted-by":"crossref","unstructured":"Reif, J., Spirakis, P.: Random matroids. In: Proceedings 12th ACM Symposium on Theory of Computing\u2014STOC 1980, pp. 385\u2013397 (1980)","DOI":"10.1145\/800141.804688"},{"key":"1_CR73","doi-asserted-by":"crossref","unstructured":"Reif, J., Spirakis, P.: Distributed algorithms for synchronizing interprocess communication within real time. In: Proceedings of 13th ACM Symposium on Theory of Computing\u2014STOC 1981, pp. 133\u2013145 (1981)","DOI":"10.1145\/800076.802467"},{"issue":"2","key":"1_CR74","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/2993.357244","volume":"6","author":"J Reif","year":"1984","unstructured":"Reif, J., Spirakis, P.: Real time synchronization of interprocess communications. ACM Trans. Programm. Lang. Syst. 6(2), 215\u2013238 (1984)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"issue":"1","key":"1_CR75","doi-asserted-by":"publisher","first-page":"7592","DOI":"10.1137\/0214005","volume":"14","author":"J Reif","year":"1985","unstructured":"Reif, J., Spirakis, P.: Unbounded speed variability in distributed systems. SIAM J. Comput. 14(1), 7592 (1985)","journal-title":"SIAM J. Comput."},{"key":"1_CR76","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/BF01758779","volume":"7","author":"J Reif","year":"1992","unstructured":"Reif, J., Spirakis, P.: Expected parallel time and sequential space complexity of graph and digraph problems. Algorithmica 7, 597\u2013630 (1992)","journal-title":"Algorithmica"},{"key":"1_CR77","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(88)90039-9","volume":"76","author":"P Spirakis","year":"1988","unstructured":"Spirakis, P.: Optimal parallel randomized algorithms for addition sparse addition and identification. Inf. Comput. 76, 1\u201312 (1988)","journal-title":"Inf. Comput."},{"key":"1_CR78","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-36383-1_10","volume-title":"Experimental Algorithmics","author":"P Spirakis","year":"2002","unstructured":"Spirakis, P., Zaroliagis, C.: Distributed algorithm engineering. In: Fleischer, R., Moret, B.M.E., Schmidt, E.M. (eds.) Experimental Algorithmics. LNCS, vol. 2547, pp. 197\u2013228. Springer, Heidelberg (2002)"},{"key":"1_CR79","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-77105-0_8","volume-title":"Internet and Network Economics","author":"H Tsaknakis","year":"2007","unstructured":"Tsaknakis, H., Spirakis, P.G.: An optimization approach for approximate Nash equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 42\u201356. Springer, Heidelberg (2007)"},{"key":"1_CR80","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-92185-1_29","volume-title":"Internet and Network Economics","author":"H Tsaknakis","year":"2008","unstructured":"Tsaknakis, H., Spirakis, P.G., Kanoulas, D.: Performance evaluation of a descent algorithm for bi-matrix games. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 222\u2013230. Springer, Heidelberg (2008)"},{"key":"1_CR81","doi-asserted-by":"crossref","unstructured":"Triantafillou, P., Ntarmos, N., Nikoletseas, S., Spirakis, P.: Nanopeer networks and P2P worlds. In: Proceedings of 3rd International Conference on Peer-to-Peer Computing\u2014P2P 2003, pp. 40\u201346 (2003)","DOI":"10.1109\/PTP.2003.1231502"},{"key":"1_CR82","unstructured":"Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical report CS-200006, Duke University (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms, Probability, Networks, and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24024-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T12:20:55Z","timestamp":1748607655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24024-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319240237","9783319240244"],"references-count":83,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24024-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}