SP1 will be devoted to the development of "innovative theories" to cope with new algorithmic problems that arise in Global Computing. It will study the structural properties of global/overlay computers, fundamental techniques for coping with selfishness and for achieving stability and fault tolerance, and will tackle the challenge of computing with partial (i.e., uncertain, distributed, or even incomplete) knowledge by blending theories from economics, game theory and algorithmic theory. A better understanding of these problems will have a strong impact on the ability to propose scalable, distributed and dynamic algorithms. That will also allow understanding the efficiency trade-off between undesirable centralized strategies and anticipated fully distributed strategies.
Full list of references and notes.
Change the membership of publications for this topic.
Authors on this topic.
Export all publications in this topic
or to RIS.
[RACTI-RU1-2008-28] Panagopoulou, Panagiota and Spirakis, Paul, , in: 19th International Symposium on Algorithms and Computation (ISAAC 2008), pages 1-15, Gold Coast, Australia, 2008. A Game Theoretic Approach for Efficient Graph Coloring
[RACTI-RU1-2008-9] Kalles, D., Kaporis, Alexis and Spirakis, Paul, , in: 7th International Workshop on Experimental Algorithms (WEA 2008), pages 181-193, Springer-Verlag Berlin Heidelberg, Massachusetts, USA, 2008. Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games
[RACTI-RU1-2007-25] Efthymiou, Charilaos and Spirakis, Paul, , 2007. Random sampling of colourings of sparse random graphs with a constant number of colours [DOI]
[RACTI-RU1-2007-24] Liagkou, Vasiliki, Makri, Effie, Spirakis, Paul and Stamatiou, Yannis, , in: European Conference on Complex Systems (ECCS 2007), Dresden, 2007. The ``Digital Territory'' as a complex system of interacting agents, emergent properties and technologies
[RACTI-RU1-2007-19] Koutsoupias, Elias, Panagopoulou, Panagiota and Spirakis, Paul, , in: 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2007), Cesky Krumlov, CZech Republic, 2007. Selfish Load Balancing under Partial Knowledge
[RACTI-RU1-2007-18] Panagopoulou, Panagiota and Spirakis, Paul, , in: 11th Panhellenic Conference on Informatics (PCI 2007), pages 569-578, Patras, Greece, 2007. Approximate and well-supported approximate Nash equilibria of random bimatrix games
[RACTI-RU1-2007-17] Panagopoulou, Panagiota and Spirakis, Paul, , in: 5th Workshop on Approximation and Online Algorithms (WAOA 2007), pages 156-169, Springer Verlag, LNCS, Eliat, Israel, 2007. Full and Local Information in Distributed Decision Making
[RACTI-RU1-2007-12] Spirakis, Paul, Kaporis, Alexis and Fotakis, Dimitris, , 2007. Atomic congestion games: fast, myopic and concurrent
[RACTI-RU1-2006-1] Kontogiannis, Spyros, Panagopoulou, Panagiota and Spirakis, Paul, , in: 2nd Workshop on Internet and Network Economics (WINE 2006), pages 286-296, Springer-Verlag, 2006. Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
[RACTI-RU1-2005-3] Mavronicolas, Marios, Panagopoulou, Panagiota and Spirakis, Paul, , in: 1st Workshop on Internet and Network Economics (WINE 2005), pages 210-224, Springer-Verlag / LNCS, 2005. A Cost Mechanism for Fair Pricing of Resource Usage