Abstract
We discuss two different ways of having fun with two different kinds of games: On the one hand, we present a framework for developing multiplayer pervasive games that rely on the use of mobile sensor networks. On the other hand, we show how to exploit game theoretic concepts in order to study the graph-theoretic problem of vertex coloring.
Partially supported by the EU within the ICT Programme under contract IST-2008-215270 (FRONTS).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akribopoulos, O., Logaras, M., Vasilakis, N., Kokkinos, P., Mylonas, G., Chatzigiannakis, I., Spirakis, P.: Developing Multiplayer Pervasive Games and Networked Interactive Installations using Ad hoc Mobile Sensor Nets. In: 5th International Conference on Advances in Computer Entertainment Technology (ACE 2009), Athens, Greece (2009)
Panagopoulou, P., Spirakis, P.: A Game Theoretic Approach for Efficient Graph Coloring. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 1–15. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spirakis, P.G., Chatzigiannakis, I., Mylonas, G., Panagopoulou, P.N. (2010). Fun with Games . In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-13122-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13121-9
Online ISBN: 978-3-642-13122-6
eBook Packages: Computer ScienceComputer Science (R0)